Optimizing airspace closure with respect to politicians’ egos

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

117 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.
Originele taal-2Engels
TitelProc. 7th International Conference on Fun with Algorithms (FUN)
RedacteurenA. Ferro, F. Luccio, P. Widmayer
Plaats van productieBerlin
UitgeverijSpringer
Pagina's264-276
ISBN van geprinte versie978-3-319-07889-2
DOI's
StatusGepubliceerd - 2014
Evenement7th International Conference on Fun with Algorithms (FUN 2014) - Lipari Island, Sicily, Italië
Duur: 1 jul 20143 jul 2014
Congresnummer: 7

Publicatie series

NaamLecture Notes in Computer Science
Volume8496
ISSN van geprinte versie0302-9743

Congres

Congres7th International Conference on Fun with Algorithms (FUN 2014)
Verkorte titelFUN 2014
LandItalië
StadLipari Island, Sicily
Periode1/07/143/07/14
Ander7th International Conference on Fun with Algorithms

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

Citeer dit