iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-319-07890-8_23
Optimizing Airspace Closure with Respect to Politicians’ Egos | SpringerLink
Skip to main content

Optimizing Airspace Closure with Respect to Politicians’ Egos

  • Conference paper
Fun with Algorithms (FUN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8496))

Included in the following conference series:

  • 1414 Accesses

Abstract

When a president is landing at a busy airport, the airspace around the airport closes for commercial traffic. We show how to schedule the presidential squadron so as to minimize its impact on scheduled civilian flights; to obtain an efficient solution we use a “rainbow” algorithm recoloring aircraft on the fly as they are stored in a special type of forest. We also give a data structure to answer the following query efficiently: Given the president’s ego (the requested duration of airspace closure), when would be the optimal time to close the airspace? Finally, we study the dual problem: Given the time when the airspace closure must start, what is the longest ego that can be tolerated without sacrificing the general traffic? We solve the problem by drawing a Christmas tree in a delay diagram; the tree allows one to solve also the query version of the problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allard, T.: Personal communication (2012)

    Google Scholar 

  2. ATCOs, Personal communication (2013)

    Google Scholar 

  3. Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Santa Clara (2008)

    Book  Google Scholar 

  4. Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. Int. J. Comput. Geometry Appl. 21(3), 253–282 (2011)

    Article  MATH  Google Scholar 

  5. Hall, F.L.: Traffic stream characteristics. In: Traffic Flow Theory, US Federal Highway Administration (1996)

    Google Scholar 

  6. Hershberger, J.: Finding the upper envelope of n line segments in O(n log n) time. Inf. Process. Lett. 33(4), 169–174 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. May, A.: Traffic Flow Fundamentals. Prentice Hall (1990)

    Google Scholar 

  8. McShane, W.R., Roess, R.P., Prassas, E.S.: Traffic Engineering. Prentice Hall (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kostitsyna, I., Löffler, M., Polishchuk, V. (2014). Optimizing Airspace Closure with Respect to Politicians’ Egos. In: Ferro, A., Luccio, F., Widmayer, P. (eds) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol 8496. Springer, Cham. https://doi.org/10.1007/978-3-319-07890-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07890-8_23

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07889-2

  • Online ISBN: 978-3-319-07890-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics