{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:13Z","timestamp":1742913853980,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031155116"},{"type":"electronic","value":"9783031155123"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15512-3_6","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:02:55Z","timestamp":1661486575000},"page":"76-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Diverse Shortest Paths in\u00a0Game Maps: A Comparative User Study and\u00a0Experiments"],"prefix":"10.1007","author":[{"given":"Lingxiao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_20"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akg\u00fcn","year":"2000","unstructured":"Akg\u00fcn, V., Erkut, E., Batta, R.: On finding dissimilar paths. Eur. J. Oper. Res. 121(2), 232\u2013246 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/3292390.3292394","volume":"10","author":"MA Cheema","year":"2018","unstructured":"Cheema, M.A.: Indoor location-based services: challenges and opportunities. SIGSPATIAL Spec. 10(2), 10\u201317 (2018)","journal-title":"SIGSPATIAL Spec."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TITS.2006.889437","volume":"8","author":"Y Chen","year":"2007","unstructured":"Chen, Y., Bell, M.G., Bogenberger, K.: Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system. IEEE Trans. Intell. Transp. Syst. 8, 14\u201320 (2007)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"6_CR5","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-dissimilar paths with minimum collective length. In: SIGSPATIAL (2018)"},{"issue":"5","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/s00778-020-00604-x","volume":"29","author":"T Chondrogiannis","year":"2020","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-shortest paths with limited overlap. VLDB J. 29(5), 1023\u20131047 (2020)","journal-title":"VLDB J."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cui, M., Harabor, D.D., Grastien, A.: Compromise-free pathfinding on a navigation mesh. In: IJCAI.,pp. 496\u2013502 (2017)","DOI":"10.24963\/ijcai.2017\/70"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"H\u00e4cker, C., Bouros, P., Chondrogiannis, T., Althaus, E.: Most diverse near-shortest paths. In: SIGSPATIAL, pp. 229\u2013239 (2021)","DOI":"10.1145\/3474717.3483955"},{"key":"6_CR9","unstructured":"Jones, A.H.: Method of and apparatus for generating routes. US Patent 8,249,810, 21 Aug 2012"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-40450-4_52","volume-title":"Algorithms \u2013 ESA 2013","author":"M Kobitzsch","year":"2013","unstructured":"Kobitzsch, M.: An alternative approach to alternative routes: HiDAR. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 613\u2013624. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_52"},{"key":"6_CR11","unstructured":"Kobitzsch, M., Radermacher, M., Schieferdecker, D.: Evolution and evaluation of the penalty method for alternative graphs. In: ATMOS, vol. 33, pp. 94\u2013107 (2013)"},{"key":"6_CR12","unstructured":"Li, L., Cheema, M.A.: Alternative pathfinding in game maps and indoor venues. In: ICAPS (2021)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Li, L., Cheema, M.A., Lu, H., Ali, M.E., Toosi, A.N.: Comparing alternative route planning techniques: a comparative user study on Melbourne. Dhaka and Copenhagen road networks. IEEE TKDE (2021)","DOI":"10.1109\/TKDE.2021.3063717"},{"issue":"4","key":"6_CR14","first-page":"445","volume":"11","author":"Y Li","year":"2017","unstructured":"Li, Y., Yiu, M.L., Kou, N.M., et al.: An experimental study on hub labeling based shortest path algorithms. PVLDB 11(4), 445\u2013457 (2017)","journal-title":"PVLDB"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TKDE.2017.2773492","volume":"30","author":"H Liu","year":"2017","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE Trans. Knowl. Data Eng. 30, 488\u2013502 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1111\/itor.13060","volume":"29","author":"A Moghanni","year":"2022","unstructured":"Moghanni, A., Pascoal, M., Godinho, M.T.: Finding shortest and dissimilar paths. Int. Trans. Oper. Res. 29(3), 1573\u20131601 (2022)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Oh, S., Leong, H.W.: Edge n-level sparse visibility graphs: fast optimal any-angle pathfinding using hierarchical taut paths. In: SoCS, pp. 64\u201372 (2017)","DOI":"10.1609\/socs.v8i1.18427"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Euclidean pathfinding with compressed path databases. In: IJCAI, pp. 4229\u20134235 (2021)","DOI":"10.24963\/ijcai.2020\/584"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15512-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:12:37Z","timestamp":1676506357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15512-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031155116","9783031155123"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15512-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sidney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2022.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}