{"id":"https://openalex.org/W2166542580","doi":"https://doi.org/10.1145/1064546.1180616","title":"Combining speed-up techniques for shortest-path computations","display_name":"Combining speed-up techniques for shortest-path computations","publication_year":2005,"publication_date":"2005-12-31","ids":{"openalex":"https://openalex.org/W2166542580","doi":"https://doi.org/10.1145/1064546.1180616","mag":"2166542580"},"language":"en","primary_location":{"id":"doi:10.1145/1064546.1180616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1180616","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/A5032901794","display_name":"Martin H\u00f6lzer","orcid":"https://orcid.org/0000-0001-7090-8717"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Holzer","raw_affiliation_strings":["Universit\u00e4t Karlsruhe, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091644374","display_name":"Frank Schulz","orcid":"https://orcid.org/0000-0002-3144-8479"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Schulz","raw_affiliation_strings":["Universit\u00e4t Karlsruhe, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Universit\u00e4t Karlsruhe, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010657180","display_name":"Thomas Willhalm","orcid":"https://orcid.org/0000-0001-8505-0936"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Willhalm","raw_affiliation_strings":["Universit\u00e4t Karlsruhe, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032901794"],"corresponding_institution_ids":["https://openalex.org/I4210119349"],"apc_list":null,"apc_paid":null,"fwci":5.4047,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.96326089,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","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":0.9998999834060669,"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.9998999834060669,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9954000115394592,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7953645586967468},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7411350011825562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7030722498893738},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6590548753738403},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6087573766708374},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6074382662773132},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5615693926811218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47067031264305115},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.47012269496917725},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.46660587191581726},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.45858901739120483},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4484435021877289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41827964782714844},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39047813415527344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36157938838005066},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.32343602180480957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23058849573135376},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.1947079300880432},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.15131208300590515}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7953645586967468},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7411350011825562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7030722498893738},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6590548753738403},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6087573766708374},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6074382662773132},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5615693926811218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47067031264305115},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.47012269496917725},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.46660587191581726},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.45858901739120483},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4484435021877289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41827964782714844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39047813415527344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36157938838005066},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.32343602180480957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23058849573135376},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.1947079300880432},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.15131208300590515}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1064546.1180616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1180616","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W27247825","https://openalex.org/W30435042","https://openalex.org/W127515624","https://openalex.org/W136556473","https://openalex.org/W1480135873","https://openalex.org/W1485262373","https://openalex.org/W1493214567","https://openalex.org/W1500924481","https://openalex.org/W1537256577","https://openalex.org/W1539048696","https://openalex.org/W1549911051","https://openalex.org/W1550136763","https://openalex.org/W1561240874","https://openalex.org/W1566918731","https://openalex.org/W1597203970","https://openalex.org/W1673383737","https://openalex.org/W1969483458","https://openalex.org/W2011824721","https://openalex.org/W2014889099","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2095352457","https://openalex.org/W2101923813","https://openalex.org/W2105808107","https://openalex.org/W2113276858","https://openalex.org/W2129673493","https://openalex.org/W2131237536","https://openalex.org/W2151021662","https://openalex.org/W2151400766","https://openalex.org/W2152545366","https://openalex.org/W2154356512","https://openalex.org/W2156153879","https://openalex.org/W2169528473","https://openalex.org/W2169910125","https://openalex.org/W2261186745","https://openalex.org/W2338905098","https://openalex.org/W2404629773","https://openalex.org/W2570988769","https://openalex.org/W2995414748","https://openalex.org/W3005391704","https://openalex.org/W3015760390","https://openalex.org/W3137299218","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2368964068","https://openalex.org/W2383519316","https://openalex.org/W3183360588","https://openalex.org/W2358094779","https://openalex.org/W2348287729","https://openalex.org/W2300444527","https://openalex.org/W2808045650","https://openalex.org/W2163494787"],"abstract_inverted_index":{"In":[0,47,98],"practice,":[1],"computing":[2],"a":[3,12,16],"shortest":[4],"path":[5],"from":[6,123],"one":[7],"node":[8],"to":[9,32],"another":[10],"in":[11],"directed":[13],"graph":[14],"is":[15,22,60],"very":[17],"common":[18],"task.":[19],"This":[20],"problem":[21],"classically":[23],"solved":[24],"by":[25],"Dijkstra's":[26,66],"algorithm.":[27,67],"Many":[28],"techniques":[29,51,64,115],"are":[30,52,136],"known":[31,75],"speed":[33],"up":[34],"this":[35],"algorithm":[36],"heuristically,":[37],"while":[38],"optimality":[39],"of":[40,57,62,73,107,132],"the":[41,105,108,114],"solution":[42],"can":[43,95],"still":[44],"be":[45,96],"guaranteed.":[46],"most":[48],"studies,":[49],"such":[50],"considered":[53],"individually.":[54],"The":[55],"focus":[56],"our":[58],"work":[59],"combination":[61],"speed-up":[63],"for":[65],"We":[68],"consider":[69],"all":[70],"possible":[71],"combinations":[72,110],"four":[74],"techniques,":[76],"namely,":[77],"goal-directed":[78],"search":[79,82],",":[80,83,86,90],"bidirectional":[81],"multilevel":[84],"approach":[85],"and":[87,91,111,126,129],"shortest-path":[88],"containers":[89],"show":[92],"how":[93,113],"these":[94],"implemented.":[97],"an":[99],"extensive":[100],"experimental":[101],"study,":[102],"we":[103],"compare":[104],"performance":[106],"various":[109],"analyze":[112],"harmonize":[116],"when":[117],"jointly":[118],"applied.":[119],"Several":[120],"real-world":[121],"graphs":[122,135],"road":[124],"maps":[125],"public":[127],"transport":[128],"three":[130],"types":[131],"generated":[133],"random":[134],"taken":[137],"into":[138],"account.":[139]},"counts_by_year":[{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}