Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

The next generation of air transportation system will have to use technology to be able to cope with the ever increasing demand for flights. Several challenging optimization problems arise in trying to maximize efficiency while maintaining safe operation in air traffic management (ATM). Constraints and issues unique to air transportation arise in the ATM domain, including weather hazards, turbulence, no-fly zones, and three-dimensional routing. The challenge is substantially compounded when the constraints vary in time and are not known with certainty, as is the case with weather hazards. Human oversight is provided by air traffic controllers, who are responsible for safe operation within a portion of airspace known as a sector. In this talk we discuss algorithmic methods that can be used in modeling and solving air traffic management problems, including routing of traffic flows, airspace configuration into load-balanced sectors, and capacity estimation in the face of dynamic and uncertain constraints and demands. We highlight several open problems.

[1]  Periklis A. Papakonstantinou.  A note on width-parameterized SAT: An exact machine-model characterization , 2009, Inf. Process. Lett..

[2]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Marko Samer,et al.  A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth , 2006, ArXiv.

[4]  Periklis A. Papakonstantinou,et al.  Complexity and Algorithms for Well-Structured k-SAT Instances , 2008, SAT.

[5]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[6]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[7]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[8]  Dieter van Melkebeek,et al.  Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses , 2010, STOC '10.

[9]  Periklis A. Papakonstantinou,et al.  Width-Parameterized SAT: Time-Space Tradeoffs , 2011 .

[10]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[11]  Dániel Marx,et al.  Known algorithms on graphs of bounded treewidth are probably optimal , 2010, SODA '11.

[12]  Johann A. Makowsky,et al.  Counting truth assignments of formulas of bounded tree-width or clique-width , 2008, Discret. Appl. Math..

[13]  Stefan Felsner,et al.  Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.

[14]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[15]  Stefan Felsner,et al.  Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

[16]  Michael T. Goodrich,et al.  Succinct Greedy Geometric Routing in the Euclidean Plane , 2008, ISAAC.

[17]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).