Optimizing airspace closure with respect to politicians’ egos

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

1 Citaat (Scopus)
23 Downloads (Pure)

Samenvatting

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. Keywords: Scheduling; Data structure; Algorithms
Originele taal-2Engels
Pagina's (van-tot)161-175
TijdschriftTheoretical Computer Science
Volume586
DOI's
StatusGepubliceerd - 2015

Vingerafdruk Duik in de onderzoeksthema's van 'Optimizing airspace closure with respect to politicians’ egos'. Samen vormen ze een unieke vingerafdruk.

Citeer dit