Complexity Results for Compressing Optimal Paths

In this work we give a first tractability analysis of Compressed Path Databases, space efficient oracles used to very quickly identify the first arc on a shortest path. We study the complexity of computing an optimal compressed path database for general directed and undirected graphs. We find that in both cases the problem is NP-complete. We also show that, for graphs which can be decomposed along articulation points, the problem can be decomposed into independent parts, with a corresponding reduction in its level of difficulty. In particular, this leads to simple and tractable algorithms which yield optimal compression results for trees.

[1]  Adi Botea.  Fast, Optimal Pathfinding with Compressed Path Databases , 2012, SOCS.

[2]  Hanan Samet,et al.  Efficient query processing on spatial networks , 2005, GIS '05.

[3]  Ben Strasser,et al.  Fast First-Move Queries through Run-Length Encoding , 2014, SOCS.

[4]  Jorge A. Baier,et al.  Moving Target Search with Compressed Path Databases , 2013, ICAPS.

[5]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[6]  Bastian Katz,et al.  Preprocessing Speed-Up Techniques Is Hard , 2010, CIAC.

[7]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[8]  Jorge A. Baier,et al.  Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps , 2015, IEEE Transactions on Computational Intelligence and AI in Games.

[9]  Ignaz Rutter,et al.  Search-space size in contraction hierarchies , 2016, Theor. Comput. Sci..

[10]  Ben Strasser,et al.  Customizable Contraction Hierarchies , 2014, SEA.

[11]  Adi Botea,et al.  Path Planning with Compressed All-Pairs Shortest Paths Data , 2013, ICAPS.

[12]  Gerhard Reinelt,et al.  The simultaneous consecutive ones problem , 2009, Theor. Comput. Sci..

[13]  Lawrence T. Kou,et al.  Polynomial Complete Consecutive Information Retrieval Problems , 1977, SIAM J. Comput..

[14]  Andrew V. Goldberg,et al.  Robust Distance Queries on Massive Networks , 2014, ESA.

[15]  Andrew V. Goldberg,et al.  Hierarchical Hub Labelings for Shortest Paths , 2012, ESA.

[16]  Adi Botea.  Ultra-Fast Optimal Pathfinding without Runtime Search , 2011, AIIDE.

[17]  Peter Sanders,et al.  Exact Routing in Large Road Networks Using Contraction Hierarchies , 2012, Transp. Sci..

[18]  Andrew V. Goldberg,et al.  Hub Labels: Theory and Practice , 2014, SEA.

[19]  Andrew V. Goldberg,et al.  The shortest path problem : ninth DIMACS implementation challenge , 2009 .

[20]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.