{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T10:16:32Z","timestamp":1790676992308,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T00:00:00Z","timestamp":1510012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,7]]},"DOI":"10.1145\/3139958.3140029","type":"proceedings-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T12:54:52Z","timestamp":1536843292000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Finding The Most Preferred Path"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Sacharidis","sequence":"first","affiliation":[{"name":"Institute of Software Technology and Interactive Systems, Technische Universit\u00e4t Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aarhus University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodoros","family":"Chondrogiannis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Free University of Bozen-Bolzano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Experimental Algorithms - 10th International Symposium (SEA). 230--241.","author":"Abraham Ittai","unstructured":"Ittai Abraham , Daniel Delling , Andrew V. Goldberg , and Renato Fonseca F. Werneck . 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks . In Experimental Algorithms - 10th International Symposium (SEA). 230--241. Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato Fonseca F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms - 10th International Symposium (SEA). 230--241."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal and H. V. Jagadish. 1989. Materialization and Incremental Update of Path Information. In ICDE. 374--383. Rakesh Agrawal and H. V. Jagadish. 1989. Materialization and Incremental Update of Path Information. In ICDE. 374--383.","DOI":"10.1109\/ICDE.1989.47238"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0455-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Saad Aljubayrin Jianzhong Qi Christian S. Jensen Rui Zhang Zhen He and Zeyi Wen. 2015. The safest path via safe zones. In ICDE. 531--542. Saad Aljubayrin Jianzhong Qi Christian S. Jensen Rui Zhang Zhen He and Zeyi Wen. 2015. The safest path via safe zones. In ICDE. 531--542.","DOI":"10.1109\/ICDE.2015.7113312"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2000.878915"},{"key":"e_1_3_2_1_7_1","unstructured":"Stephan B\u00f6rzs\u00f6nyi Donald Kossmann and Konrad Stocker. 2001. The Skyline Operator. In ICDE. 421--430. Stephan B\u00f6rzs\u00f6nyi Donald Kossmann and Konrad Stocker. 2001. The Skyline Operator. In ICDE. 421--430."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1381"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1075967.1075971"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90318-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2015.29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Theodoros Chondrogiannis and Johann Gamper. 2016. ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks. In MDM. 242--251. Theodoros Chondrogiannis and Johann Gamper. 2016. ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks. In MDM. 242--251.","DOI":"10.1109\/MDM.2016.45"},{"key":"e_1_3_2_1_16_1","unstructured":"Edith Cohen Eran Halperin Haim Kaplan and Uri Zwick. 2002. Reachability and distance queries via 2-hop labels. In SODA. 937--946. Edith Cohen Eran Halperin Haim Kaplan and Uri Zwick. 2002. Reachability and distance queries via 2-hop labels. In SODA. 937--946."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820808"},{"key":"e_1_3_2_1_18_1","volume-title":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319--333.","author":"Geisberger Robert","year":"2008","unstructured":"Robert Geisberger , Peter Sanders , Dominik Schultes , and Daniel Delling . 2008 . Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319--333. Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319--333."},{"key":"e_1_3_2_1_19_1","volume-title":"Goldberg and Chris Harrelson","author":"Andrew","year":"2005","unstructured":"Andrew V. Goldberg and Chris Harrelson . 2005 . Computing the shortest path: A search meets graph theory. In SODA. 156--165. Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In SODA. 156--165."},{"key":"e_1_3_2_1_20_1","volume-title":"Werneck","author":"Goldberg Andrew V.","year":"2006","unstructured":"Andrew V. Goldberg , Haim Kaplan , and Renato F . Werneck . 2006 . Reach for A*: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM , Philadelphia. 129--143. Andrew V. Goldberg, Haim Kaplan, and Renato F. Werneck. 2006. Reach for A*: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia. 129--143."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00594-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3221322.3221681"},{"key":"e_1_3_2_1_23_1","unstructured":"R. V. Helgason J. L. Kennington and K. H. Lewis. 1997. Shortest path algorithms on grid graphs with applications to strike planning. Technical Report. DTIC Document. R. V. Helgason J. L. Kennington and K. H. Lewis. 1997. Shortest path algorithms on grid graphs with applications to strike planning. Technical Report. DTIC Document."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-010-9157-y"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Hans-Peter Kriegel Matthias Renz and Matthias Schubert. 2010. Route skyline queries: A multi-preference path planning approach. In ICDE. 261--272. Hans-Peter Kriegel Matthias Renz and Matthias Schubert. 2010. Route skyline queries: A multi-preference path planning approach. In ICDE. 261--272.","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Alain Lambert and Dominique Gruyer. 2003. Safe path planning in an uncertain-configuration space. In ICRA. 4185--4190. Alain Lambert and Dominique Gruyer. 2003. Safe path planning in an uncertain-configuration space. In ICRA. 4185--4190.","DOI":"10.1109\/ROBOT.2003.1242246"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1201\/b12690-17"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence. 1795--1800","author":"Letchner Julia","year":"2006","unstructured":"Julia Letchner , John Krumm , and Eric Horvitz . 2006 . Trip Router with Individualized Preferences (TRIP): Incorporating Personalization into Route Planning . In Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence. 1795--1800 . Julia Letchner, John Krumm, and Eric Horvitz. 2006. Trip Router with Individualized Preferences (TRIP): Incorporating Personalization into Route Planning. In Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence. 1795--1800."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820835"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166253.1166282"},{"key":"e_1_3_2_1_33_1","first-page":"127","article-title":"Bi-directional Search","volume":"6","author":"Pohl I","year":"1971","unstructured":"I Pohl . 1971 . Bi-directional Search . Machine Intelligence 6 (1971), 127 -- 140 . I Pohl. 1971. Bi-directional Search. Machine Intelligence 6 (1971), 127--140.","journal-title":"Machine Intelligence"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631799"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Michael Shekelyan Gregor Joss\u00e9 and Matthias Schubert. 2015. Linear path skylines in multicriteria networks. In ICDE. 459--470. Michael Shekelyan Gregor Joss\u00e9 and Matthias Schubert. 2015. Linear path skylines in multicriteria networks. In ICDE. 459--470.","DOI":"10.1109\/ICDE.2015.7113306"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Michael Shekelyan Gregor Joss\u00e9 and Matthias Schubert. 2015. ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation. In SSTD. 40--58. Michael Shekelyan Gregor Joss\u00e9 and Matthias Schubert. 2015. ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation. In SSTD. 40--58.","DOI":"10.1007\/978-3-319-22363-6_3"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653840"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90248-8"},{"key":"e_1_3_2_1_40_1","volume-title":"Overmars","author":"van den Berg Jur P.","year":"2006","unstructured":"Jur P. van den Berg and Mark H . Overmars . 2006 . Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. In WAFR. 103--118. Jur P. van den Berg and Mark H. Overmars. 2006. Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. In WAFR. 103--118."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0378-1"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"}],"event":{"name":"SIGSPATIAL'17: 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Redondo Beach CA USA","acronym":"SIGSPATIAL'17","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139958.3140029","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3139958.3140029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T05:34:03Z","timestamp":1751866443000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139958.3140029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,7]]},"references-count":42,"alternative-id":["10.1145\/3139958.3140029","10.1145\/3139958"],"URL":"https:\/\/doi.org\/10.1145\/3139958.3140029","relation":{},"subject":[],"published":{"date-parts":[[2017,11,7]]},"assertion":[{"value":"2017-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}