{"id":"https://openalex.org/W4311012214","doi":"https://doi.org/10.1145/3571282","title":"Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks","display_name":"Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks","publication_year":2022,"publication_date":"2022-11-30","ids":{"openalex":"https://openalex.org/W4311012214","doi":"https://doi.org/10.1145/3571282"},"language":"en","primary_location":{"id":"doi:10.1145/3571282","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571282","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571282","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3571282","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017319337","display_name":"Ben Strasser","orcid":"https://orcid.org/0000-0002-3391-6221"},"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":"Ben Strasser","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3391-6221","affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011166399","display_name":"Tim Zeitz","orcid":"https://orcid.org/0000-0003-4746-3582"},"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":"Tim Zeitz","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4746-3582","affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14038013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"28"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9886000156402588,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8163361549377441},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6431646943092346},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6084513664245605},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5918386578559875},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5552637577056885},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46902361512184143},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39933255314826965},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3439229428768158},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1576099693775177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14593985676765442},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.12969037890434265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11252427101135254},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08731436729431152}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8163361549377441},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6431646943092346},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6084513664245605},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5918386578559875},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5552637577056885},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46902361512184143},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39933255314826965},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3439229428768158},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1576099693775177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14593985676765442},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12969037890434265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11252427101135254},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08731436729431152},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3571282","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571282","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571282","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3571282","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571282","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571282","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4311012214.pdf","grobid_xml":"https://content.openalex.org/works/W4311012214.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W1483530364","https://openalex.org/W1520740947","https://openalex.org/W1592025499","https://openalex.org/W1599935894","https://openalex.org/W1779869868","https://openalex.org/W1872406954","https://openalex.org/W1904636577","https://openalex.org/W1969483458","https://openalex.org/W1977943748","https://openalex.org/W2050634818","https://openalex.org/W2071974437","https://openalex.org/W2091492284","https://openalex.org/W2104317982","https://openalex.org/W2118382442","https://openalex.org/W2140836772","https://openalex.org/W2143072141","https://openalex.org/W2143083884","https://openalex.org/W2144050074","https://openalex.org/W2144375401","https://openalex.org/W2146583842","https://openalex.org/W2150418461","https://openalex.org/W2152545366","https://openalex.org/W2169528473","https://openalex.org/W2238062996","https://openalex.org/W2241862190","https://openalex.org/W2266528661","https://openalex.org/W2294432048","https://openalex.org/W2296618433","https://openalex.org/W2399690039","https://openalex.org/W2465485717","https://openalex.org/W2566374834","https://openalex.org/W2608239929","https://openalex.org/W2609578772","https://openalex.org/W2898099857","https://openalex.org/W2955410971","https://openalex.org/W2962938151","https://openalex.org/W2963809597","https://openalex.org/W2966212751","https://openalex.org/W2966456106","https://openalex.org/W2994003192","https://openalex.org/W2994987435","https://openalex.org/W2995414748","https://openalex.org/W3036151039","https://openalex.org/W3080468723","https://openalex.org/W3139204283","https://openalex.org/W3164219999","https://openalex.org/W3164657252","https://openalex.org/W3187892110","https://openalex.org/W4237536814","https://openalex.org/W4281620620","https://openalex.org/W4285068835","https://openalex.org/W4389615664","https://openalex.org/W6633514799","https://openalex.org/W6639753265"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W3046370962"],"abstract_inverted_index":{"We":[0,128],"study":[1,206],"exact,":[2],"efficient,":[3,132],"and":[4,54,69,91,121,133,193],"practical":[5],"algorithms":[6,20,65],"for":[7,48,106,199,213],"route":[8,98],"planning":[9,44,99],"applications":[10,36],"in":[11,108,190],"large":[12],"road":[13,109,191],"networks.":[14,110],"On":[15,31],"the":[16,32,40,60,83,182,208],"one":[17],"hand,":[18,34],"such":[19,64],"should":[21],"be":[22,67],"able":[23,70],"to":[24,71,86,96,180],"answer":[25],"shortest":[26,164],"path":[27],"queries":[28],"within":[29],"milliseconds.":[30],"other":[33,56],"routing":[35,107],"often":[37],"require":[38],"integrating":[39],"current":[41],"traffic":[42],"situation,":[43],"ahead":[45],"with":[46],"predictions":[47],"future":[49],"traffic,":[50],"respecting":[51],"forbidden":[52],"turns,":[53],"many":[55,97,167,214],"features":[57],"depending":[58],"on":[59],"specific":[61],"application.":[62],"Therefore,":[63],"must":[66],"flexible":[68],"support":[72],"a":[73,88,130,150,172,195],"variety":[74],"of":[75,146,184,210],"problem":[76],"variants.":[77],"In":[78],"this":[79],"work,":[80],"we":[81,176],"revisit":[82],"A*":[84,101,135,178],"algorithm":[85,155],"build":[87],"simple,":[89],"extensible,":[90],"unified":[92],"algorithmic":[93],"framework":[94],"applicable":[95],"problems.":[100],"has":[102],"been":[103],"previously":[104],"used":[105],"However,":[111],"its":[112],"performance":[113],"was":[114,126],"not":[115],"competitive":[116],"because":[117],"no":[118],"sufficiently":[119],"fast":[120],"tight":[122],"distance":[123],"estimation":[124],"function":[125],"available.":[127],"present":[129,194],"novel,":[131],"accurate":[134],"heuristic":[136,148],"using":[137],"Contraction":[138,152],"Hierarchies,":[139],"another":[140],"popular":[141],"speedup":[142],"technique.":[143],"The":[144],"core":[145],"our":[147,211],"is":[149],"new":[151,196],"Hierarchies":[153],"query":[154],"called":[156],"Lazy":[157],"RPHAST":[158],",":[159],"which":[160,187],"can":[161],"efficiently":[162],"compute":[163],"distances":[165],"from":[166],"incrementally":[168],"provided":[169],"sources":[170],"toward":[171],"common":[173],"target.":[174],"Additionally,":[175],"describe":[177],"optimizations":[179],"accelerate":[181],"processing":[183],"low-degree":[185],"vertices,":[186],"are":[188],"typical":[189],"networks,":[192],"pruning":[197],"criterion":[198],"symmetrical":[200],"bidirectional":[201],"A*.":[202],"An":[203],"extensive":[204],"experimental":[205],"confirms":[207],"practicality":[209],"approach":[212],"applications.":[215]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}