{"id":"https://openalex.org/W2296055404","doi":"https://doi.org/10.1145/2820783.2820858","title":"Alternative routing","display_name":"Alternative routing","publication_year":2015,"publication_date":"2015-11-03","ids":{"openalex":"https://openalex.org/W2296055404","doi":"https://doi.org/10.1145/2820783.2820858","mag":"2296055404"},"language":"en","primary_location":{"id":"doi:10.1145/2820783.2820858","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000400301","display_name":"Theodoros Chondrogiannis","orcid":"https://orcid.org/0000-0002-9623-9133"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Theodoros Chondrogiannis","raw_affiliation_strings":["Free University of Bozen-Bolzano, Italy"],"affiliations":[{"raw_affiliation_string":"Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016904523","display_name":"Panagiotis Bouros","orcid":"https://orcid.org/0000-0002-8846-4330"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Panagiotis Bouros","raw_affiliation_strings":["Hunboldt-Universit\u00e4t zu Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Hunboldt-Universit\u00e4t zu Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043864804","display_name":"Johann Gamper","orcid":"https://orcid.org/0000-0002-7128-507X"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Johann Gamper","raw_affiliation_strings":["Free University of Bozen-Bolzano, Italy"],"affiliations":[{"raw_affiliation_string":"Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055236937","display_name":"Ulf Leser","orcid":"https://orcid.org/0000-0003-2166-9582"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulf Leser","raw_affiliation_strings":["Hunboldt-Universit\u00e4t zu Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Hunboldt-Universit\u00e4t zu Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000400301"],"corresponding_institution_ids":["https://openalex.org/I171543936"],"apc_list":null,"apc_paid":null,"fwci":1.7371,"has_fulltext":true,"cited_by_count":45,"citation_normalized_percentile":{"value":0.85878301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.760647177696228},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7338402271270752},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7051951289176941},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6756508946418762},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6559733152389526},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48843351006507874},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.46869659423828125},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4676988124847412},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4577364921569824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.451038658618927},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4508022964000702},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.42783230543136597},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4252112805843353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3780793845653534},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3240126967430115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2424735128879547},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.20706751942634583},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1348879039287567}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.760647177696228},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7338402271270752},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7051951289176941},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6756508946418762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6559733152389526},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48843351006507874},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.46869659423828125},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4676988124847412},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4577364921569824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.451038658618927},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4508022964000702},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.42783230543136597},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4252112805843353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3780793845653534},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3240126967430115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2424735128879547},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.20706751942634583},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1348879039287567},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2820783.2820858","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.39UBZ_INST:11236224290001241","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?doid=2820783.2820858","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"event"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/41130","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1c1tkagu2twpj6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems. New York, NY: ACM Press, 2015, 68. ISBN 978-1-4503-3967-4. Available under: doi: 10.1145/2820783.2820858","raw_type":"doc-type:Text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5600000023841858,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W1552451308","https://openalex.org/W1605658942","https://openalex.org/W1977943748","https://openalex.org/W2011282943","https://openalex.org/W2014889099","https://openalex.org/W2016499857","https://openalex.org/W2029323734","https://openalex.org/W2041916017","https://openalex.org/W2052120747","https://openalex.org/W2085248615","https://openalex.org/W2104317982","https://openalex.org/W2115826669","https://openalex.org/W2142311862","https://openalex.org/W2952476710","https://openalex.org/W4299574825"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2368964068","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W4293054712","https://openalex.org/W2388654557","https://openalex.org/W1987046149","https://openalex.org/W2161960576","https://openalex.org/W2347324889"],"abstract_inverted_index":{"Shortest":[0],"path":[1,24],"computation":[2],"is":[3,25],"a":[4,82,95,99,120,129],"fundamental":[5],"problem":[6,62],"in":[7,12,15,33,102,139],"road":[8,156],"networks":[9,157],"with":[10,58],"application":[11],"various":[13],"domains":[14],"research":[16],"and":[17,76,108,158],"industry.":[18],"However,":[19],"returning":[20],"only":[21],"the":[22,55,92,111,136,145,149],"shortest":[23],"often":[26],"not":[27],"satisfying;":[28],"users":[29],"are":[30,70],"also":[31],"interested":[32],"alternative":[34,67],"paths":[35,68,93],"which":[36,69],"might":[37],"be":[38],"longer":[39],"but":[40],"have":[41],"other":[42],"advantages,":[43],"e.g.,":[44],"less":[45],"frequent":[46],"traffic":[47],"congestion.":[48],"In":[49],"this":[50],"paper,":[51],"we":[52],"formally":[53],"introduce":[54],"k-Shortest":[56,125],"Paths":[57],"Limited":[59],"Overlap":[60],"(k-SPwLO)":[61],"seeking":[63],"to":[64,98],"recommend":[65],"k":[66],"(a)":[71],"as":[72,74],"short":[73],"possible":[75],"(b)":[77],"sufficiently":[78],"dissimilar":[79],"based":[80],"on":[81,154],"user-controlled":[83],"similarity":[84],"threshold.":[85],"We":[86,147],"propose":[87],"two":[88],"algorithms":[89,153],"that":[90,160],"examine":[91],"from":[94],"source":[96],"s":[97],"target":[100],"t":[101],"increasing":[103],"order":[104],"of":[105,151],"their":[106],"length":[107],"progressively":[109],"construct":[110],"result":[112],"set.":[113],"The":[114,132],"baseline":[115],"algorithm":[116,122,134],"BSL":[117],"builds":[118],"upon":[119],"standard":[121],"for":[123],"computing":[124],"Paths,":[126],"followed":[127],"by":[128],"filter":[130],"step.":[131],"OnePass":[133,161],"considers":[135],"overlap":[137],"constraint":[138],"each":[140],"expansion":[141],"step":[142],"while":[143],"traversing":[144],"network.":[146],"evaluate":[148],"performance":[150],"both":[152],"real":[155],"show":[159],"always":[162],"outperforms":[163],"BSL.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2016-06-24T00:00:00"}