{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T14:58:28Z","timestamp":1790521108069,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CH 2464\/1-1"],"award-info":[{"award-number":["CH 2464\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1145\/3474717.3483955","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T18:59:49Z","timestamp":1636052389000},"page":"229-239","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Most Diverse Near-Shortest Paths"],"prefix":"10.1145","author":[{"given":"Christian","family":"H\u00e4cker","sequence":"first","affiliation":[{"name":"Johannes Gutenberg University Mainz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg University Mainz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodoros","family":"Chondrogiannis","sequence":"additional","affiliation":[{"name":"University of Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ernst","family":"Althaus","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg University Mainz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2005. Choice Routing. Cambridge Vehicle Information Technology Ltd.. http:\/\/www.camvit.com  2005. Choice Routing. Cambridge Vehicle Information Technology Ltd.. http:\/\/www.camvit.com"},{"key":"e_1_3_2_1_2_1","volume-title":"Werneck","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham , Daniel Delling , Andrew V. Goldberg , and Renato F . Werneck . 2013 . Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013). Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2013. Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Roland Bader Jonathan Dees Robert Geisberger and Peter Sanders. 2011. Alternative Route Graphs in Road Networks. In ICST TAPAS. 21--32.  Roland Bader Jonathan Dees Robert Geisberger and Peter Sanders. 2011. Alternative Route Graphs in Road Networks. In ICST TAPAS. 21--32.","DOI":"10.1007\/978-3-642-19754-3_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1381"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1075967.1075971"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Dan Cheng Olga Gkountouna Andreas Z\u00fcfle Dieter Pfoser and Carola Wenk. 2019. Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study. In IWCTS@SIGSPATIAL. 10:1--10:10.  Dan Cheng Olga Gkountouna Andreas Z\u00fcfle Dieter Pfoser and Carola Wenk. 2019. Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study. In IWCTS@SIGSPATIAL. 10:1--10:10.","DOI":"10.1145\/3357000.3366137"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Alternative Routing: K-shortest Paths with Limited Overlap","volume":"68","author":"Chondrogiannis Theodoros","year":"2015","unstructured":"Theodoros Chondrogiannis , Panagiotis Bouros , Johann Gamper , and Ulf Leser . 2015 . Alternative Routing: K-shortest Paths with Limited Overlap . In ACM SIGSPATIAL GIS. 68 : 1 -- 68 :4. Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, and Ulf Leser. 2015. Alternative Routing: K-shortest Paths with Limited Overlap. In ACM SIGSPATIAL GIS. 68:1--68:4.","journal-title":"ACM SIGSPATIAL GIS."},{"key":"e_1_3_2_1_10_1","unstructured":"Theodoros Chondrogiannis Panagiotis Bouros Johann Gamper and Ulf Leser. 2017. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. In EDBT. 414--425.  Theodoros Chondrogiannis Panagiotis Bouros Johann Gamper and Ulf Leser. 2017. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. In EDBT. 414--425."},{"key":"e_1_3_2_1_11_1","volume-title":"Blumenthal","author":"Chondrogiannis Theodoros","year":"2018","unstructured":"Theodoros Chondrogiannis , Panagiotis Bouros , Johann Gamper , Ulf Leser , and David B . Blumenthal . 2018 . Finding k-dissimilar paths with minimum collective length. In ACM SIGSPATIAL GIS. 404--407. Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, and David B. Blumenthal. 2018. Finding k-dissimilar paths with minimum collective length. In ACM SIGSPATIAL GIS. 404--407."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00604-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Daniel Delling and Dorothea Wagner. 2009. Pareto Paths with SHARC. In SEA. 125--136.  Daniel Delling and Dorothea Wagner. 2009. Pareto Paths with SHARC. In SEA. 125--136.","DOI":"10.1007\/978-3-642-02011-7_13"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428538"},{"key":"e_1_3_2_1_16_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness . M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0041-8"},{"key":"e_1_3_2_1_19_1","volume-title":"A Protocol to Convert Spatial Polyline Data to Network Formats and Applications to World Urban Road Networks. Scientific Data 3, 160046","author":"Karduni Alireza","year":"2016","unstructured":"Alireza Karduni , Amirhassan Kermanshah , and Sybil Derrible . 2016. A Protocol to Convert Spatial Polyline Data to Network Formats and Applications to World Urban Road Networks. Scientific Data 3, 160046 ( 2016 ). Alireza Karduni, Amirhassan Kermanshah, and Sybil Derrible. 2016. A Protocol to Convert Spatial Polyline Data to Network Formats and Applications to World Urban Road Networks. Scientific Data 3, 160046 (2016)."},{"key":"e_1_3_2_1_20_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 2005. The Art of Computer Programming , Volume 4 , Fascicle 3: Generating All Combinations and Partitions. Addison-Wesley Professional . Donald E. Knuth. 2005. The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions. Addison-Wesley Professional."},{"key":"e_1_3_2_1_21_1","volume-title":"Route skyline queries: A multi-preference path planning approach","author":"Kriegel Hans-Peter","unstructured":"Hans-Peter Kriegel , Matthias Renz , and Matthias Schubert . 2010. Route skyline queries: A multi-preference path planning approach . In IEEE ICDE. 261--272. Hans-Peter Kriegel, Matthias Renz, and Matthias Schubert. 2010. Route skyline queries: A multi-preference path planning approach. In IEEE ICDE. 261--272."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407822"},{"key":"e_1_3_2_1_23_1","volume-title":"Hua Lu, Mohammed Eunus Ali, and Adel Nadjaran Toosi.","author":"Li Lingxiao","year":"2021","unstructured":"Lingxiao Li , Muhammad Aamir Cheema , Hua Lu, Mohammed Eunus Ali, and Adel Nadjaran Toosi. 2021 . Comparing Alternative Route Planning Techniques: A Comparative User Study on Melbourne, Dhaka and Copenhagen Road Networks. IEEE TKDE preprint (2021). Lingxiao Li, Muhammad Aamir Cheema, Hua Lu, Mohammed Eunus Ali, and Adel Nadjaran Toosi. 2021. Comparing Alternative Route Planning Techniques: A Comparative User Study on Melbourne, Dhaka and Copenhagen Road Networks. IEEE TKDE preprint (2021)."},{"key":"e_1_3_2_1_24_1","first-page":"488","article-title":"Finding Top-k Shortest Paths with Diversity","volume":"30","author":"Liu Huiping","year":"2018","unstructured":"Huiping Liu , Cheqing Jin , Bin Yang , and Aoying Zhou . 2018 . Finding Top-k Shortest Paths with Diversity . IEEE TKDE 30 , 3 (2018), 488 -- 502 . Huiping Liu, Cheqing Jin, Bin Yang, and Aoying Zhou. 2018. Finding Top-k Shortest Paths with Diversity. IEEE TKDE 30, 3 (2018), 488--502.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_25_1","article-title":"Candidate Sets for Alternative Routes in Road Networks","volume":"19","author":"Luxen Dennis","year":"2014","unstructured":"Dennis Luxen and Dennis Schieferdecker . 2014 . Candidate Sets for Alternative Routes in Road Networks . ACM J. Exp. Algorithmics 19 , 1 (2014). Dennis Luxen and Dennis Schieferdecker. 2014. Candidate Sets for Alternative Routes in Road Networks. ACM J. Exp. Algorithmics 19, 1 (2014).","journal-title":"ACM J. Exp. Algorithmics"},{"key":"e_1_3_2_1_26_1","volume-title":"Preference Queries in Large Multi-cost Transportation Networks","author":"Mouratidis Kyriakos","unstructured":"Kyriakos Mouratidis , Yimin Lin , and Man lu Yiu . 2010. Preference Queries in Large Multi-cost Transportation Networks . In IEEE ICDE. 533--544. Kyriakos Mouratidis, Yimin Lin, and Man lu Yiu. 2010. Preference Queries in Large Multi-cost Transportation Networks. In IEEE ICDE. 533--544."},{"key":"e_1_3_2_1_27_1","volume-title":"Efficient Hop-constrained st Simple Path Enumeration. The VLDB Journal","author":"Peng You","year":"2021","unstructured":"You Peng , Xuemin Lin , Ying Zhang , Wenjie Zhang , Lu Qin , and Jingren Zhou . 2021. Efficient Hop-constrained st Simple Path Enumeration. The VLDB Journal ( 2021 ), 1--25. You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin, and Jingren Zhou. 2021. Efficient Hop-constrained st Simple Path Enumeration. The VLDB Journal (2021), 1--25."},{"key":"e_1_3_2_1_28_1","volume-title":"Timothy Smith, and E","author":"Rouphail Nagui M.","year":"1995","unstructured":"Nagui M. Rouphail , S. Ranji Ranjithan , Wael El Dessouki , Timothy Smith, and E . Downey Brill . 1995 . A Decision Support System for Dynamic Pre-Trip Route Planning. In AATTE. 325--329. Nagui M. Rouphail, S. Ranji Ranjithan, Wael El Dessouki, Timothy Smith, and E. Downey Brill. 1995. A Decision Support System for Dynamic Pre-Trip Route Planning. In AATTE. 325--329."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.09.017"},{"key":"e_1_3_2_1_30_1","volume-title":"Marios Hadjieleftheriou, Divesh Srivastava, Caetano Traina, and Vassilis J Tsotras.","author":"Vieira Marcos R","year":"2011","unstructured":"Marcos R Vieira , Humberto L Razente , Maria CN Barioni , Marios Hadjieleftheriou, Divesh Srivastava, Caetano Traina, and Vassilis J Tsotras. 2011 . On query result diversification. In IEEE ICDE. 1163--1174. Marcos R Vieira, Humberto L Razente, Maria CN Barioni, Marios Hadjieleftheriou, Divesh Srivastava, Caetano Traina, and Vassilis J Tsotras. 2011. On query result diversification. In IEEE ICDE. 1163--1174."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0990-4"}],"event":{"name":"SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems","location":"Beijing China","acronym":"SIGSPATIAL '21","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 29th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474717.3483955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:11:46Z","timestamp":1750176706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":30,"alternative-id":["10.1145\/3474717.3483955","10.1145\/3474717"],"URL":"https:\/\/doi.org\/10.1145\/3474717.3483955","relation":{},"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}