{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:00Z","timestamp":1725544020258},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_29","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"316-327","source":"Crossref","is-referenced-by-count":19,"title":["Goal Directed Shortest Path Queries Using Precomputed Cluster Distances"],"prefix":"10.1007","author":[{"given":"Jens","family":"Maue","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Matijevic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"29_CR2","unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments (2004)"},{"key":"29_CR3","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)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Kaplan, H., Werneck, R.: Reach for A\n                           *: Efficient point-to-point shortest path algorithms. In: Workshop on Algorithm Engineering & Experiments, Miami (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"29_CR5","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A\n                           * meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165 (2005)"},{"key":"29_CR6","unstructured":"Goldberg, A.V., Werneck, R.F.: An efficient external memory shortest path algorithm. In: Workshop on Algorithm Engineering & Experiments, pp. 26\u201340 (2005)"},{"key":"29_CR7","unstructured":"Goldberg, A.: personal communication (2005)"},{"key":"29_CR8","unstructured":"Sanders, P.: Speeding up shortest path queries using a sample of precomputed distances. In: Workshop on Algorithmic Methods for Railway Optimization, Dagstuhl (June 2004), slides at: \n                    \n                      http:\/\/www.dagstuhl.de\/04261\/"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra\u2019s algorithm. In: 4th International Workshop on Efficient and Experimental Algorithms (2005)","DOI":"10.1007\/11427186_18"},{"key":"29_CR10","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: M\u00fcnster GI-Days (2004)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F. Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.D.: Using multi-level graphs for timetable information. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D. Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 776\u2013787. Springer, Heidelberg (2003)"},{"key":"29_CR13","unstructured":"Karypis, G., Kumar, V.: Metis: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices (1995), \n                    \n                      http:\/\/www-users.cs.umn.edu\/~karypis\/metis\/"},{"key":"29_CR14","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"29_CR15","unstructured":"U.S. Census Bureau: UA Census 2000 TIGER\/Line files (2002), \n                    \n                      http:\/\/www.census.gov\/geo\/www\/tiger\/tigerua\/ua_tgr2k.html"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:56Z","timestamp":1619507456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11764298_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}