Optimizing Airspace Closure with respect to Politicians' Egos

Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk

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


    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 publicationFun with Algorithms
    Subtitle of host publication7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings
    EditorsAlfredo Ferro, Fabrizio Luccio, Peter Widmayer
    Number of pages13
    ISBN (Electronic)978-3-319-07890-8
    ISBN (Print)978-3-319-07889-2
    Publication statusPublished - 2014

    Publication series

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


    • CG, DS, GRAPH


    Dive into the research topics of 'Optimizing Airspace Closure with respect to Politicians' Egos'. Together they form a unique fingerprint.

    Cite this