Optimizing airspace closure with respect to politicians’ egos

I. Kostitsyna, M. Löffler, V. Polishchuk

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
232 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProc. 7th International Conference on Fun with Algorithms (FUN)
EditorsA. Ferro, F. Luccio, P. Widmayer
Place of PublicationBerlin
ISBN (Print)978-3-319-07889-2
Publication statusPublished - 2014
Event7th International Conference on Fun with Algorithms (FUN 2014) - Lipari Island, Sicily, Italy
Duration: 1 Jul 20143 Jul 2014
Conference number: 7

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference7th International Conference on Fun with Algorithms (FUN 2014)
Abbreviated titleFUN 2014
CityLipari Island, Sicily


Dive into the research topics of 'Optimizing airspace closure with respect to politicians’ egos'. Together they form a unique fingerprint.

Cite this