Optimizing Airspace Closure with respect to Politicians' Egos

Irina Kostitsyna; Maarten Löffler; Valentin Polishchuk

doi:10.1007/978-3-319-07890-8_23

Optimizing Airspace Closure with respect to Politicians' Egos

Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

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.

Original language	English
Title of host publication	Fun with Algorithms
Subtitle of host publication	7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings
Editors	Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
Publisher	Springer
Pages	264-276
Number of pages	13
ISBN (Electronic)	978-3-319-07890-8
ISBN (Print)	978-3-319-07889-2
DOIs	https://doi.org/10.1007/978-3-319-07890-8_23
Publication status	Published - 2014

Publication series

Name	Lecture Notes in Computer Science
Volume	8496
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

CG, DS, GRAPH

Access to Document

10.1007/978-3-319-07890-8_23

Embargoed Document

23
Final published version, 354 KB
Embargo ends: 1/01/50

Cite this

Kostitsyna, I., Löffler, M., & Polishchuk, V. (2014). Optimizing Airspace Closure with respect to Politicians' Egos. In A. Ferro, F. Luccio, & P. Widmayer (Eds.), Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings (pp. 264-276). (Lecture Notes in Computer Science; Vol. 8496). Springer. https://doi.org/10.1007/978-3-319-07890-8_23

Kostitsyna, Irina ; Löffler, Maarten ; Polishchuk, Valentin. / Optimizing Airspace Closure with respect to Politicians' Egos. Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. editor / Alfredo Ferro ; Fabrizio Luccio ; Peter Widmayer. Springer, 2014. pp. 264-276 (Lecture Notes in Computer Science).

@inproceedings{a04a2eea21b244989941a655c334123a,

title = "Optimizing Airspace Closure with respect to Politicians' Egos",

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.",

keywords = "CG, DS, GRAPH",

author = "Irina Kostitsyna and Maarten L{\"o}ffler and Valentin Polishchuk",

year = "2014",

doi = "10.1007/978-3-319-07890-8_23",

language = "English",

isbn = "978-3-319-07889-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "264--276",

editor = "Ferro, {Alfredo } and { Luccio}, Fabrizio and Widmayer, {Peter }",

booktitle = "Fun with Algorithms",

}

Kostitsyna, I, Löffler, M & Polishchuk, V 2014, Optimizing Airspace Closure with respect to Politicians' Egos. in A Ferro, F Luccio & P Widmayer (eds), Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8496, Springer, pp. 264-276. https://doi.org/10.1007/978-3-319-07890-8_23

Optimizing Airspace Closure with respect to Politicians' Egos. / Kostitsyna, Irina; Löffler, Maarten; Polishchuk, Valentin.
Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. ed. / Alfredo Ferro; Fabrizio Luccio; Peter Widmayer. Springer, 2014. p. 264-276 (Lecture Notes in Computer Science; Vol. 8496).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Optimizing Airspace Closure with respect to Politicians' Egos

AU - Kostitsyna, Irina

AU - Löffler, Maarten

AU - Polishchuk, Valentin

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - CG, DS, GRAPH

U2 - 10.1007/978-3-319-07890-8_23

DO - 10.1007/978-3-319-07890-8_23

M3 - Conference contribution

SN - 978-3-319-07889-2

T3 - Lecture Notes in Computer Science

SP - 264

EP - 276

BT - Fun with Algorithms

A2 - Ferro, Alfredo

A2 - Luccio, Fabrizio

A2 - Widmayer, Peter

PB - Springer

ER -

Optimizing Airspace Closure with respect to Politicians' Egos

Abstract

Publication series

Keywords

Access to Document

Embargoed Document

Fingerprint

Cite this