Polynomial-time construction of contraction hierarchies for multi-criteria objectives

Proceedings of the Workshop on Algorithm Engineering and Experiments

Volumn , Issue , 2013, Pages 41-54

  Funke, Stefan ^a   Storandt, Sabine ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARETO PRINCIPLE; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

LOWER ENVELOPES; MULTI-CRITERIA; OBJECTIVE FUNCTIONS; PARETO-OPTIMAL; POLYNOMIAL-TIME; SHORTEST PATH PROBLEM; SHORTEST PATH QUERIES; SPEED-UP TECHNIQUES;

EXPERIMENTS;

EID: 84916884926     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972931.4     Document Type: Conference Paper

References (12)

1. I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. Alternative routes in road networks. In Proceedings of the 9th international conference on Experimental Algorithms, SEA'10, pages 23-34, Berlin, Heidelberg, 2010. Springer-Verlag.
2. V. Aggarwal, Y. Aneja, and K. Nair. Minimal spanning tree subject to a side constraint. In 32nd ACM Symposium on Theory of Computing (STOC), pages 286-295, 1982.
3. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316(5824):566, Apr. 2007.
4. D. Delling and D. Wagner. Pareto paths with sharc. In J. Vahrenhold, editor, Experimental Algorithms, volume 5526 of Lecture Notes in Computer Science, pages 125-136. Springer Berlin Heidelberg, 2009.
5. R. Geisberger, M. Kobitzsch, and P. Sanders. Route planning with flexible objective functions. In ALENEX'10, pages 124-137, 2010.
6. R. Geisberger, M. N. Rice, P. Sanders, and V. J. Tsotras. Route planning with flexible edge restrictions. J. Exp. Algorithmics, 17(1):1.2:1.1-1.2:1.20, Mar. 2012.
7. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In WEA, pages 319-333, 2008.
8. A. Goldberg, H. Kaplan, and R. F. Werneck. Reach for a: Efficient point-to-point shortest path algorithms. In In Workshop on Algorithm Engineering and Experiments (ALENEX), 2006.
9. A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA'05, pages 156-165, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
10. U. Lauther. Slow preprocessing of graphs for extremely fast shortest path calculations. Lecture at the Workshop on Computational Integer Programming at ZIB., 1997.
11. K. Mehlhorn and M. Ziegelmann. Resource constrained shortest paths. In M. Paterson, editor, Algorithms - ESA 2000, volume 1879 of Lecture Notes in Computer Science, pages 326-337. Springer Berlin/Heidelberg, 2000.
12. S. Storandt. Route planning for bicycles - exact constrained shortest paths made practical via contraction hierarchy. In 22nd Int. Conf. on Automated Planning and Scheduling (ICAPS), 2012.