{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T12:02:35Z","timestamp":1722686555258},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,14]],"date-time":"2015-05-14T00:00:00Z","timestamp":1431561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10707-015-0229-7","type":"journal-article","created":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T16:46:51Z","timestamp":1431535611000},"page":"1-18","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["SPLZ: An efficient algorithm for single source shortest path problem using compression method"],"prefix":"10.1007","volume":"20","author":[{"given":"Jingwei","family":"Sun","sequence":"first","affiliation":[]},{"given":"Guangzhong","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,14]]},"reference":[{"key":"229_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths in road networks. In: Experimental Algorithms, Springer, pp 230\u2013241","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"229_CR2","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2012) Hldb: Location-based services in databases. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, ACM, New York, NY, USA, SIGSPATIAL \u201912, pp 339\u2013348, doi: 10.1145\/2424321.2424365 , (to appear in print)","DOI":"10.1145\/2424321.2424365"},{"issue":"2","key":"229_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja RK, Mehlhorn K, Orlin J, Tarjan RE (1990) Faster algorithms for the shortest path problem. J ACM (JACM) 37(2):213\u2013223","journal-title":"J ACM (JACM)"},{"key":"229_CR4","doi-asserted-by":"crossref","unstructured":"Arz J, Luxen D, Sanders P (2013) Transit node routing reconsidered. In: Experimental Algorithms, Springer, pp 55\u201366","DOI":"10.1007\/978-3-642-38527-8_7"},{"issue":"5824","key":"229_CR5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast H, Funke S, Sanders P, Schultes D (2007) Fast routing in road networks with transit nodes. Science 316(5824):566\u2013566","journal-title":"Science"},{"issue":"7","key":"229_CR6","first-page":"757","volume":"23","author":"T Bell","year":"1993","unstructured":"Bell T, Kulp D (1993) Longest-match string searching for ziv-lempel compression. Software: Practice and Experience 23(7):757\u2013771","journal-title":"Software: Practice and Experience"},{"key":"229_CR7","unstructured":"Bellman R (1956) On a routing problem. Tech rep, DTIC Document"},{"issue":"8","key":"229_CR8","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/net.3230230808","volume":"23","author":"DP Bertsekas","year":"1993","unstructured":"Bertsekas DP (1993) A simple and fast label correcting algorithm for shortest paths. Networks 23(8):703\u2013709","journal-title":"Networks"},{"issue":"2","key":"229_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02192173","volume":"88","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas DP, Guerriero F, Musmanno R (1996) Parallel asynchronous label-correcting methods for shortest paths. J Optim Theory Appl 88(2):297\u2013320","journal-title":"J Optim Theory Appl"},{"key":"229_CR10","doi-asserted-by":"crossref","unstructured":"Botea A, Baier JA, Harabor D, Hern\u00e1ndez C (2013) Moving target search with compressed path databases. Proceedings of ICAPS-13","DOI":"10.1609\/icaps.v23i1.13599"},{"issue":"2","key":"229_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: Theory and experimental evaluation. Math Program 73(2):129\u2013174","journal-title":"Math Program"},{"key":"229_CR12","first-page":"7","volume":"14","author":"BV Cherkassky","year":"2009","unstructured":"Cherkassky BV, Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF (2009) Shortest-path feasibility algorithms: An experimental evaluation. J Exp Algorithmics (JEA) 14:7","journal-title":"J Exp Algorithmics (JEA)"},{"key":"229_CR13","volume-title":"Introduction to algorithms, vol 2","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C, et al. (2001) Introduction to algorithms, vol 2. MIT press, Cambridge"},{"issue":"7","key":"229_CR14","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling D, Goldberg AV, Nowatzyk A, Werneck RF (2013a) Phast: Hardware-accelerated shortest path trees. J Parallel Distrib Comput 73(7):940\u2013952","journal-title":"J Parallel Distrib Comput"},{"key":"229_CR15","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2013b) Customizable route planning in road networks. In: Sixth Annual Symposium on Combinatorial Search"},{"key":"229_CR16","doi-asserted-by":"crossref","unstructured":"Demetrescu C, Goldberg AV, Johnson DS (2009) The Shortest Path Problem: Ninth DIMACS Implementation Challenge, vol 74. American Mathematical Soc","DOI":"10.1090\/dimacs\/074"},{"issue":"11","key":"229_CR17","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"RB Dial","year":"1969","unstructured":"Dial RB (1969) Algorithm 360: Shortest-path forest with topological ordering [h]. Commun ACM 12(11):632\u2013633","journal-title":"Commun ACM"},{"issue":"1","key":"229_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische mathematik 1(1):269\u2013271","journal-title":"Numerische mathematik"},{"key":"229_CR19","doi-asserted-by":"crossref","unstructured":"Gallo G, Pallottino S (1986) Shortest path methods: A unifying approach. Netflow at Pisa, pp 38\u201364","DOI":"10.1007\/BFb0121087"},{"key":"229_CR20","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: Experimental Algorithms, Springer, pp 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"issue":"1","key":"229_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.33.1.65","volume":"33","author":"F Glover","year":"1985","unstructured":"Glover F, Klingman D, Phillips N (1985) A new polynomially bounded shortest path algorithm. Oper Res 33(1):65\u201373","journal-title":"Oper Res"},{"key":"229_CR22","unstructured":"Goldberg AV, Harrelson C (2005) Computing the shortest path: A search meets graph theory. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp 156\u2013165"},{"key":"229_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/dimacs\/074\/03","volume":"74","author":"M Hilger","year":"2009","unstructured":"Hilger M, K\u00f6hler E, M\u00f6hring RH, Schilling H (2009) Fast point-to-point shortest path computations with arc-flags. The Shortest Path Problem: Ninth DIMACS Implementation Challenge 74:41\u201372","journal-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge"},{"issue":"2","key":"229_CR24","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth DE, Morris JH Jr, Pratt VR (1977) Fast pattern matching in strings. SIAM J Comput 6(2):323\u2013350","journal-title":"SIAM J Comput"},{"key":"229_CR25","doi-asserted-by":"crossref","unstructured":"Madduri K, Bader DA, Berry JW, Crobak JR (2006) Parallel shortest path algorithms for solving large-scale instances","DOI":"10.1137\/1.9781611972870.3"},{"key":"229_CR26","first-page":"2:3.2","volume":"14","author":"J Maue","year":"2010","unstructured":"Maue J, Sanders P, Matijevic D (2010) Goal-directed shortest-path queries using precomputed cluster distances. J Exp Algorithmics 14:2:3.2\u20132:3.27. doi: 10.1145\/1498698.1564502","journal-title":"J Exp Algorithmics"},{"issue":"1","key":"229_CR27","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer U, Sanders P (2003) \u03b4-stepping: a parallelizable shortest path algorithm. J Algorithms 49(1):114\u2013152","journal-title":"J Algorithms"},{"issue":"2","key":"229_CR28","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","volume":"14","author":"S Pallottino","year":"1984","unstructured":"Pallottino S (1984) Shortest-path methods: Complexity, interrelations and new propositions. Networks 14(2):257\u2013267","journal-title":"Networks"},{"issue":"1","key":"229_CR29","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U Pape","year":"1974","unstructured":"Pape U (1974) Implementation and efficiency of moore-algorithms for the shortest route problem. Math Program 7(1):212\u2013222","journal-title":"Math Program"},{"key":"229_CR30","doi-asserted-by":"crossref","unstructured":"Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: Algorithms\u2013Esa 2005, Springer, pp 568\u2013579","DOI":"10.1007\/11561071_51"},{"key":"229_CR31","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan J, Alborzi H, Samet H (2005) Efficient query processing on spatial networks. In: Proceedings of the 13th annual ACM international workshop on Geographic information systems, ACM, pp 200\u2013209","DOI":"10.1145\/1097064.1097093"},{"issue":"1","key":"229_CR32","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.14778\/1687627.1687763","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. Proc VLDB Endowment 2(1):1210\u20131221","journal-title":"Proc VLDB Endowment"},{"issue":"3","key":"229_CR33","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans Inf Theory 23(3):337\u2013343","journal-title":"IEEE Trans Inf Theory"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-015-0229-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-015-0229-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-015-0229-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T13:34:09Z","timestamp":1691674449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-015-0229-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,14]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s10707-015-0229-7","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,14]]}}}