{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:59Z","timestamp":1775912999301,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP200103650 AND LP180100018"],"award-info":[{"award-number":["DP200103650 AND LP180100018"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00778-022-00760-2","type":"journal-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T19:02:52Z","timestamp":1660244572000},"page":"595-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Multi-constraint shortest path using forest hop labeling"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2468-3104","authenticated-orcid":false,"given":"Ziyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"760_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.trb.2014.09.005","volume":"70","author":"JD Adler","year":"2014","unstructured":"Adler, J.D., Mirchandani, P.B.: Online routing and battery reservations for electric vehicles with swappable batteries. Transp. Res. Part B Methodol. 70, 285\u2013302 (2014)","journal-title":"Transp. Res. Part B Methodol."},{"key":"760_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349\u2013360. ACM (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"4","key":"760_CR3","first-page":"256","volume":"52","author":"WM Carlyle","year":"2008","unstructured":"Carlyle, W.M., Royset, J.O., Kevin Wood, R.: Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Netw. Int. J. 52(4), 256\u2013270 (2008)","journal-title":"Netw. Int. J."},{"issue":"6","key":"760_CR4","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s00778-012-0274-x","volume":"21","author":"L Chang","year":"2012","unstructured":"Chang, L., Yu, J.X., Qin, L., Cheng, H., Qiao, M.: The exact distance to destination in undirected world. VLDB J. 21(6), 869\u2013888 (2012)","journal-title":"VLDB J."},{"issue":"6","key":"760_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/65.752646","volume":"12","author":"S Chen","year":"1998","unstructured":"Chen, S., Nahrstedt, K.: An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Netw. 12(6), 64\u201379 (1998)","journal-title":"IEEE Netw."},{"key":"760_CR6","doi-asserted-by":"crossref","unstructured":"Chondrogiannis, T., Gamper, J.: Pardisp: a partition-based framework for distance and shortest path queries on road networks. In: 2016 17th IEEE International Conference on Mobile Data Management (MDM), vol. 1, pp. 242\u2013251. IEEE (2016)","DOI":"10.1109\/MDM.2016.45"},{"issue":"5","key":"760_CR7","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"760_CR8","doi-asserted-by":"crossref","unstructured":"De Neve, H., Van Mieghem, P.: A multiple quality of service routing algorithm for PNNI. In: 1998 IEEE ATM Workshop Proceedings, pp. 324\u2013328 (1998)","DOI":"10.1109\/ATM.1998.675192"},{"issue":"2","key":"760_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2017","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566\u2013591 (2017)","journal-title":"Transp. Sci."},{"key":"760_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: IPDPS, pp. 1135\u20131146 (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"760_CR11","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Pareto paths with SHARC. In: International Symposium on Experimental Algorithms, pp. 125\u2013136. Springer (2009)","DOI":"10.1007\/978-3-642-02011-7_13"},{"issue":"1","key":"760_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"760_CR13","doi-asserted-by":"crossref","unstructured":"Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-k simple shortest paths discovery in graphs. In: CIKM, pp. 509\u2013518 (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"760_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. Freeman San Francisco (1979)"},{"key":"760_CR15","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: WEA, pp. 319\u2013333. Springer (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"760_CR16","doi-asserted-by":"crossref","unstructured":"Godfrey, P., Shipley, R., Gryz, J., et al.: Maximal vector computation in large data sets. In: Proceedings of the VLDB Endowment, vol. 5, pp. 229\u2013240. Citeseer (2005)","DOI":"10.1007\/s00778-006-0029-7"},{"key":"760_CR17","doi-asserted-by":"crossref","unstructured":"Gong, Q., Cao, H., Nagarkar, P.: Skyline queries constrained by multi-cost transportation networks. In: ICDE, pp. 926\u2013937. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00087"},{"issue":"4","key":"760_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10(4), 293\u2013309 (1980)","journal-title":"Networks"},{"key":"760_CR19","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion path problems. In: Multiple criteria decision making theory and application, pp. 109\u2013127. Springer (1980)","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"1","key":"760_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"760_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"JM Jaffe","year":"1984","unstructured":"Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks 14(1), 95\u2013116 (1984)","journal-title":"Networks"},{"issue":"2","key":"760_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"HC Joksch","year":"1966","unstructured":"Joksch, H.C.: The shortest route problem with constraints. J. Math. Anal. Appl. 14(2), 191\u2013197 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"760_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.-G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"760_CR24","unstructured":"Jung, S., Pramanik, S.: HiTi graph model of topographical road maps in navigation systems. In: Proceedings of the Twelfth International Conference on Data Engineering, pp. 76\u201384. IEEE (1996)"},{"issue":"5","key":"760_CR25","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"760_CR26","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovski, B., M\u00e9cs, I., Rajk\u00f3, Z.: Lagrange relaxation based method for the qos routing problem. In: INFOCOM, vol. 2, pp. 859\u2013868. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"760_CR27","unstructured":"Karypis, G., et al.: Family of multilevel partitioning algorithms (1997)"},{"key":"760_CR28","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: INFOCOM, vol. 2, pp. 834\u2013843 (2001)","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"760_CR29","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity queries in large traffic networks. In: ACM GIS, pp. 1\u20138 (2007)","DOI":"10.1145\/1341012.1341040"},{"key":"760_CR30","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: ICDE 2010, pp. 261\u2013272. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"760_CR31","doi-asserted-by":"crossref","unstructured":"Kuipers, F., Orda, A., Raz, D., Van Mieghem, P.: A comparison of exact and $$\\varepsilon $$-approximation algorithms for constrained routing. In: NETWORKING, pp. 197\u2013208. Springer (2006)","DOI":"10.1007\/11753810_17"},{"issue":"11","key":"760_CR32","first-page":"1274","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. PVLDB 10(11), 1274\u20131285 (2017)","journal-title":"PVLDB"},{"key":"760_CR33","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: ICDE, pp. 902\u2013913, April (2019)","DOI":"10.1109\/ICDE.2019.00085"},{"key":"760_CR34","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Fastest path query answering using time-dependent hop-labeling in road network. In: TKDE (2020)","DOI":"10.1109\/TKDE.2020.2981062"},{"key":"760_CR35","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00107"},{"issue":"3","key":"760_CR36","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00778-018-0499-4","volume":"27","author":"L Li","year":"2018","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J. 27(3), 321\u2013345 (2018)","journal-title":"VLDB J."},{"key":"760_CR37","doi-asserted-by":"crossref","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: SIGMOD, pp. 1060\u20131077 (2019)","DOI":"10.1145\/3299869.3319877"},{"key":"760_CR38","doi-asserted-by":"crossref","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling up distance labeling on graphs with core-periphery properties. In: SIGMOD, pp. 1367\u20131381 (2020)","DOI":"10.1145\/3318464.3389748"},{"key":"760_CR39","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, L., Zhang, M., Hua, W., Chao, P., Zhou, X.: Efficient constrained shortest path query answering with forest hop labeling. In: ICDE, IEEE (2021)","DOI":"10.1007\/s00778-022-00760-2"},{"issue":"5","key":"760_CR40","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"760_CR41","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.cor.2012.07.008","volume":"40","author":"L Lozano","year":"2013","unstructured":"Lozano, L., Medaglia, A.L.: On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1), 378\u2013384 (2013)","journal-title":"Comput. Oper. Res."},{"key":"760_CR42","doi-asserted-by":"crossref","unstructured":"Lu, Y., Shahabi, C.: An arc orienteering algorithm to find the most scenic path on a large-scale road network. In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1\u201310 (2015)","DOI":"10.1145\/2820783.2820835"},{"issue":"1","key":"760_CR43","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: $$\\delta $$-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003)","journal-title":"J. Algorithms"},{"key":"760_CR44","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: SIGMOD, pp. 709\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"760_CR45","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Yuan, L., Zhang, F., Qin, L., Lin, X.: Towards efficient path skyline computation in bicriteria networks. In: DASFAA, pp. 239\u2013254. Springer (2018)","DOI":"10.1007\/978-3-319-91452-7_16"},{"key":"760_CR46","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp. 467\u2013478 (2003)","DOI":"10.1145\/872757.872814"},{"key":"760_CR47","unstructured":"Pellegrini, F.: Scotch: static mapping, graph, mesh and hypergraph partitioning, and parallel and sequential sparse matrix ordering package, 2007. Cited on, p. 3 (2005)"},{"issue":"3","key":"760_CR48","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"760_CR49","first-page":"602","volume":"265","author":"A Sede\u00f1o-Noda","year":"2015","unstructured":"Sede\u00f1o-Noda, A., Alonso-Rodr\u00edguez, S.: An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Appl. Math. Comput. 265, 602\u2013618 (2015)","journal-title":"Appl. Math. Comput."},{"key":"760_CR50","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tre.2017.02.002","volume":"101","author":"N Shi","year":"2017","unstructured":"Shi, N., Zhou, S., Wang, F., Tao, Y., Liu, L.: The multi-criteria constrained shortest path problem. Transp. Res. Part E Logist. Transp. Rev. 101, 13\u201329 (2017)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"760_CR51","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy. In: ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13495"},{"issue":"1","key":"760_CR52","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","volume":"45","author":"G Tsaggouris","year":"2009","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: improved FPTAS for shortest paths and non-linear objectives with applications. Theory Comput. Syst. 45(1), 162\u2013186 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"760_CR53","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0140-3664(02)00156-1","volume":"26","author":"P Van Mieghem","year":"2003","unstructured":"Van Mieghem, P., Kuipers, F.A.: On the complexity of QoS routing. Comput. Commun. 26(4), 376\u2013387 (2003)","journal-title":"Comput. Commun."},{"key":"760_CR54","doi-asserted-by":"crossref","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: SIGMOD, pp. 967\u2013982 (2015)","DOI":"10.1145\/2723372.2749456"},{"issue":"2","key":"760_CR55","first-page":"61","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. PVLDB 10(2), 61\u201372 (2016)","journal-title":"PVLDB"},{"key":"760_CR56","doi-asserted-by":"crossref","unstructured":"Wang, Z., Crowcroft, J.: Bandwidth-delay based routing algorithms. In: GLOBECOM, vol. 3, pp. 2129\u20132133. IEEE (1995)","DOI":"10.1109\/GLOCOM.1995.502780"},{"key":"760_CR57","doi-asserted-by":"crossref","unstructured":"Wei, F.: TEDI: efficient shortest path query answering on graphs. In: Graph Data Management: Techniques and Applications, pp. 214\u2013238. IGI Global (2012)","DOI":"10.4018\/978-1-61350-053-8.ch009"},{"issue":"9","key":"760_CR58","first-page":"721","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. PVLDB 7(9), 721\u2013732 (2014)","journal-title":"PVLDB"},{"issue":"2","key":"760_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11280-021-00871-w","volume":"24","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Zhang, H., Gao, H., Wang, X.: An efficient index method for the optimal path query over multi-cost networks. World Wide Web 24(2), 1\u201323 (2021)","journal-title":"World Wide Web"},{"issue":"11","key":"760_CR60","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."},{"key":"760_CR61","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks. In: ICDE, IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"760_CR62","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Stream processing of shortest path query in dynamic road networks. In: TKDE (2020)","DOI":"10.1007\/978-3-030-39469-1_9"},{"key":"760_CR63","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient 2-hop labeling maintenance in dynamic small-world networks. In: ICDE, IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"760_CR64","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Zhou, X.: An experimental evaluation and guideline for path finding in weighted dynamic network. In: Proceedings of the VLDB Endowment, vol. 14, no. 11, pp. 2127\u20132140 (2021)","DOI":"10.14778\/3476249.3476267"},{"key":"760_CR65","doi-asserted-by":"crossref","unstructured":"Zhang, X., Liu, Z., Zhang, M., Li, L.: An experimental study on exact multi-constraint shortest path finding. In: ADC 2021, Dunedin, New Zealand, pp. 166\u2013179. Springer (2021)","DOI":"10.1007\/978-3-030-69377-0_14"},{"issue":"8","key":"760_CR66","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K.-L., Zhou, L., Gong, Z.: G-tree: an efficient and scalable index for spatial search on road networks. IEEE Trans. Knowl. Data Eng. 27(8), 2175\u20132189 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00760-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00760-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00760-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T07:19:51Z","timestamp":1727767191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00760-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["760"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00760-2","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,11]]},"assertion":[{"value":"19 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}