Optimizing airspace closure with respect to politicians’ egos

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

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

Optimizing airspace closure with respect to politicians’ egos

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

Algorithms

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

1 Citation (Scopus)

232 Downloads (Pure)

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	Proc. 7th International Conference on Fun with Algorithms (FUN)
Editors	A. Ferro, F. Luccio, P. Widmayer
Place of Publication	Berlin
Publisher	Springer
Pages	264-276
ISBN (Print)	978-3-319-07889-2
DOIs	https://doi.org/10.1007/978-3-319-07890-8_23
Publication status	Published - 2014
Event	7th International Conference on Fun with Algorithms (FUN 2014) - Lipari Island, Sicily, Italy Duration: 1 Jul 2014 → 3 Jul 2014 Conference number: 7

Publication series

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

Conference

Conference	7th International Conference on Fun with Algorithms (FUN 2014)
Abbreviated title	FUN 2014
Country/Territory	Italy
City	Lipari Island, Sicily
Period	1/07/14 → 3/07/14

Access to Document

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

paper_47Final author version , 353 KB

Cite this

@inproceedings{461ee06cf33348f59bb37731c421c6da,

title = "Optimizing airspace closure with respect to politicians{\textquoteright} 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{\textquoteright}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.",

author = "I. Kostitsyna and M. L{\"o}ffler and V. 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 = "A. Ferro and F. Luccio and P. Widmayer",

booktitle = "Proc. 7th International Conference on Fun with Algorithms (FUN)",

address = "Germany",

note = "7th International Conference on Fun with Algorithms (FUN 2014), FUN 2014 ; Conference date: 01-07-2014 Through 03-07-2014",

}

Kostitsyna, I, Löffler, M & Polishchuk, V 2014, Optimizing airspace closure with respect to politicians’ egos. in A Ferro, F Luccio & P Widmayer (eds), Proc. 7th International Conference on Fun with Algorithms (FUN). Lecture Notes in Computer Science, vol. 8496, Springer, Berlin, pp. 264-276, 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Sicily, Italy, 1/07/14. https://doi.org/10.1007/978-3-319-07890-8_23

Optimizing airspace closure with respect to politicians’ egos. / Kostitsyna, I.; Löffler, M.; Polishchuk, V.
Proc. 7th International Conference on Fun with Algorithms (FUN). ed. / A. Ferro; F. Luccio; P. Widmayer. Berlin: 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, I.

AU - Löffler, M.

AU - Polishchuk, V.

N1 - Conference code: 7

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.

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 - Proc. 7th International Conference on Fun with Algorithms (FUN)

A2 - Ferro, A.

A2 - Luccio, F.

A2 - Widmayer, P.

PB - Springer

CY - Berlin

T2 - 7th International Conference on Fun with Algorithms (FUN 2014)

Y2 - 1 July 2014 through 3 July 2014

ER -

Optimizing airspace closure with respect to politicians’ egos

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this