{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:24Z","timestamp":1764557244227,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_58","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"690-699","source":"Crossref","is-referenced-by-count":30,"title":["VC-Dimension and Shortest Path Algorithms"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"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.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 782\u2013793 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1.9781611972870.5","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007)","author":"H. Bast","year":"2007","unstructured":"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\u201359. SIAM, Philadelphia (2007)"},{"issue":"5824","key":"58_CR4","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.: Almost Optimal Set Covers in Finite VC-dimension. Discrete and Computational Geometry\u00a014, 463\u2013497 (1995)","journal-title":"Discrete and Computational Geometry"},{"key":"58_CR6","first-page":"452","volume-title":"Proc. 29th IEEE Annual Symposium on Foundations of Computer Science","author":"K.L. Clarkson","year":"1988","unstructured":"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\u2013456. IEEE, Los Alamitos (1988)"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-57155-8_252","volume-title":"Proc. 3rd Workshop Algo. Data Struct.","author":"K.L. Clarkson","year":"1993","unstructured":"Clarkson, K.L.: Algorithms for Polytope Covering and Approximation. In: Proc. 3rd Workshop Algo. Data Struct., pp. 246\u2013252. Springer, New York (1993)"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)","DOI":"10.1137\/S0097539702403098"},{"key":"58_CR9","volume-title":"25th International Parallel and Distributed Processing Symposium (IPDPS 2011)","author":"D. Delling","year":"2011","unstructured":"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)"},{"key":"58_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"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.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G. Even","year":"2005","unstructured":"Even, G., Rawitz, D., Shahar, S.: Hitting Sets when the VC-dimension is Small. Inf. Process. Lett.\u00a095, 358\u2013362 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"58_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance Labeling in Graphs. J. Algorithms\u00a053(1), 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"58_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"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.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"58_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1090\/dimacs\/074\/05","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"A. Goldberg","year":"2009","unstructured":"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\u2013140. AMS, Providence (2009)"},{"key":"58_CR15","unstructured":"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\u2013111 (2004)"},{"key":"58_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximation Algorithms for Combinatorial Problems. J.\u00a0Comput. Syst. Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"58_CR17","first-page":"231","volume-title":"Proc. 41nd IEEE Annual Symposium on Foundations of Computer Science","author":"J. Kleinberg","year":"2008","unstructured":"Kleinberg, J.: Detecting a Network Failure. In: Proc. 41nd IEEE Annual Symposium on Foundations of Computer Science, pp. 231\u2013239. IEEE, Los Alamitos (2008)"},{"key":"58_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"issue":"1","key":"58_CR19","first-page":"1","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate Distance Oracles. J.\u00a0ACM\u00a052(1), 1\u201324 (2005)","journal-title":"J.\u00a0ACM"},{"key":"58_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications\u00a016, 264\u2013280 (1971)","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:13:24Z","timestamp":1558296804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}