{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:55Z","timestamp":1775912995827,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T00:00:00Z","timestamp":1541462400000},"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":[[2018,11,6]]},"DOI":"10.1145\/3274895.3274903","type":"proceedings-article","created":{"date-parts":[[2018,11,14]],"date-time":"2018-11-14T13:19:29Z","timestamp":1542201569000},"page":"404-407","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Finding\n            <i>k<\/i>\n            -dissimilar paths with minimum collective length"],"prefix":"10.1145","author":[{"given":"Theodoros","family":"Chondrogiannis","sequence":"first","affiliation":[{"name":"University of Konstanz"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg University Mainz"}]},{"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano"}]},{"given":"Ulf","family":"Leser","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin"}]},{"given":"David B.","family":"Blumenthal","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano"}]}],"member":"320","published-online":{"date-parts":[[2018,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2005. Choice Routing. Cambridge Vehicle Information Technology Ltd.. (2005).  2005. Choice Routing. Cambridge Vehicle Information Technology Ltd.. (2005)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444019"},{"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":"publisher","DOI":"10.5555\/1987334.1987339"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820858"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of the 20th EDBT Conf. 414--425","author":"Chondrogiannis Theodoros","year":"2017"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274903"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00121-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0041-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","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).","DOI":"10.1038\/sdata.2016.46"},{"key":"e_1_3_2_1_11_1","unstructured":"Donald E. Knuth. 2005. The Art of Computer Programming Vol. 4 Fas. 3: Generating All Combinations and Partitions. Addison-Wesley Professional Boston MA USA.   Donald E. Knuth. 2005. The Art of Computer Programming Vol. 4 Fas. 3: Generating All Combinations and Partitions. Addison-Wesley Professional Boston MA USA."},{"key":"e_1_3_2_1_12_1","first-page":"488","article-title":"Finding Top-k Shortest Paths with Diversity","volume":"30","author":"Liu H","year":"2017","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"event":{"name":"SIGSPATIAL '18: 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Seattle Washington","acronym":"SIGSPATIAL '18","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274895.3274903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274895.3274903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:49Z","timestamp":1750208269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274895.3274903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,6]]},"references-count":13,"alternative-id":["10.1145\/3274895.3274903","10.1145\/3274895"],"URL":"https:\/\/doi.org\/10.1145\/3274895.3274903","relation":{},"subject":[],"published":{"date-parts":[[2018,11,6]]},"assertion":[{"value":"2018-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}