VC-dimension and shortest path algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 690-699

  Abraham, Ittai ^a   Delling, Daniel ^a   Fiat, Amos ^b   Goldberg, Andrew V ^a   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE CASE; GRAPH ALGORITHMS; LEARNING THEORY; QUERY ALGORITHMS; ROAD NETWORK; SET SYSTEM; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SHORTEST PATH PROBLEM; TIME BOUND; VC-DIMENSION;

ALGORITHMS; MOTOR TRANSPORTATION; SET THEORY; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 79960022546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_58     Document Type: Conference Paper

References (20)

1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230-241. Springer, Heidelberg (2011)
2. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 782-793 (2010)
3. Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 46-59. SIAM, Philadelphia (2007)
4. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007)
5. Brönnimann, H., Goodrich, M.: Almost Optimal Set Covers in Finite VC-dimension. Discrete and Computational Geometry 14, 463-497 (1995)
6. Clarkson, K.L.: A Las Vegas Algorithm for Linear Programming When the Dimension is Small. In: Proc. 29th IEEE Annual Symposium on Foundations of Computer Science, pp. 452-456. IEEE, Los Alamitos (1988)
7. Clarkson, K.L.: Algorithms for Polytope Covering and Approximation. In: Proc. 3rd Workshop Algo. Data Struct., pp. 246-252. Springer, New York (1993)
8. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)
9. Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: 25th International Parallel and Distributed Processing Symposium (IPDPS 2011). IEEE Computer Society, Los Alamitos (2011)
10. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
11. Even, G., Rawitz, D., Shahar, S.: Hitting Sets when the VC-dimension is Small. Inf. Process. Lett. 95, 358-362 (2005)
12. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. J. Algorithms 53(1), 85-112 (2004)
13. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008)
14. Goldberg, A., Kaplan, H., Werneck, R.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, C., Goldberg, A., Johnson, D. (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp. 93-140. AMS, Providence (2009)
15. Gutman, R.: Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proc. 6th International Workshop on Algorithm Engineering and Experiments, pp. 100-111 (2004)
16. Johnson, D.: Approximation Algorithms for Combinatorial Problems. J. Comput. Syst. Sci. 9, 256-278 (1974)
17. Kleinberg, J.: Detecting a Network Failure. In: Proc. 41nd IEEE Annual Symposium on Foundations of Computer Science, pp. 231-239. IEEE, Los Alamitos (2008)
18. Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568-579. Springer, Heidelberg (2005)
19. Thorup, M., Zwick, U.: Approximate Distance Oracles. J. ACM 52(1), 1-24 (2005)
20. Vapnik, V., Chervonenkis, A.: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications 16, 264-280 (1971)