{"id":"https://openalex.org/W1988872756","doi":"https://doi.org/10.1145/2133803.2133805","title":"Route planning with flexible edge restrictions","display_name":"Route planning with flexible edge restrictions","publication_year":2012,"publication_date":"2012-03-27","ids":{"openalex":"https://openalex.org/W1988872756","doi":"https://doi.org/10.1145/2133803.2133805","mag":"1988872756"},"language":"en","primary_location":{"id":"doi:10.1145/2133803.2133805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2133803.2133805","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-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/A5041710251","display_name":"Robert Geisberger","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Robert Geisberger","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT)"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT)","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028161236","display_name":"Michael N. Rice","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael N. Rice","raw_affiliation_strings":["University of California, Riverside (UCR)","University of California, Riverside (UCR)#TAB#"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside (UCR)","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside (UCR)#TAB#","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT)"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT)","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000947547","display_name":"Vassilis J. Tsotras","orcid":"https://orcid.org/0000-0001-5462-9451"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vassilis J. Tsotras","raw_affiliation_strings":["University of California, Riverside (UCR)","University of California, Riverside (UCR)#TAB#"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside (UCR)","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside (UCR)#TAB#","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041710251"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":2.4485,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.9138596,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"17","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7512869834899902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7299140095710754},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.592402458190918},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.526221513748169},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4351348578929901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4225218594074249},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41927894949913025},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4147213101387024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3680172264575958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19629094004631042},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14288422465324402},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12082293629646301},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08494088053703308}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7512869834899902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7299140095710754},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.592402458190918},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.526221513748169},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4351348578929901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4225218594074249},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41927894949913025},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4147213101387024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3680172264575958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19629094004631042},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14288422465324402},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12082293629646301},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08494088053703308},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2133803.2133805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2133803.2133805","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G5492422045","display_name":null,"funder_award_id":"IIS-0705916IIS-0803410","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W113019534","https://openalex.org/W190901240","https://openalex.org/W1493214567","https://openalex.org/W1599935894","https://openalex.org/W1810931192","https://openalex.org/W1969483458","https://openalex.org/W1996936086","https://openalex.org/W2014889099","https://openalex.org/W2113276858","https://openalex.org/W2120783268","https://openalex.org/W2148831787","https://openalex.org/W2150418461","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2995414748","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W2295196644","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W2128644323"],"abstract_inverted_index":{"In":[0],"this":[1,90],"work,":[2],"we":[3],"explore":[4],"a":[5,41],"new":[6],"type":[7,23],"of":[8,24,52,89,95,107,130],"flexible":[9,71],"shortest-path":[10],"query,":[11],"in":[12,30,40],"which":[13],"the":[14,22,31,37,53,59,83,93,105,108,116,120,125],"query":[15,87],"can":[16],"be":[17,28],"dynamically":[18],"parameterized":[19],"to":[20,67,134],"constrain":[21],"edges":[25],"that":[26,44],"may":[27],"included":[29],"resulting":[32],"shortest":[33,38],"path":[34,39],"(e.g.,":[35],"find":[36],"road":[42,122],"network":[43],"avoids":[45],"toll":[46],"roads":[47],"and":[48,86,103,119,128],"low":[49],"overpasses,":[50],"respective":[51],"specified":[54],"vehicle":[55],"height).":[56],"We":[57,73],"extend":[58],"hierarchical":[60],"preprocessing":[61],"technique":[62],"known":[63],"as":[64],"Contraction":[65],"Hierarchies":[66],"efficiently":[68],"support":[69],"such":[70],"queries.":[72],"also":[74],"present":[75],"several":[76],"effective":[77],"algorithmic":[78],"optimizations":[79],"for":[80,114],"further":[81],"improving":[82],"overall":[84],"scalability":[85,129],"times":[88],"approach,":[91],"including":[92],"addition":[94],"goal-directed":[96],"search":[97,99],"techniques,":[98,102],"space":[100],"pruning":[101],"generalizing":[104],"constraints":[106],"local":[109],"search.":[110],"Experiments":[111],"are":[112],"presented":[113],"both":[115],"North":[117],"American":[118],"European":[121],"networks,":[123],"showcasing":[124],"general":[126],"effectiveness":[127],"our":[131],"proposed":[132],"methodology":[133],"large-scale,":[135],"real-world":[136],"graphs.":[137]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}