{"id":"https://openalex.org/W2575116237","doi":"https://doi.org/10.1090/dimacs/074/05","title":"Reach for A*: shortest path algorithms with preprocessing","display_name":"Reach for A*: shortest path algorithms with preprocessing","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2575116237","doi":"https://doi.org/10.1090/dimacs/074/05","mag":"2575116237"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074/05","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/05","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Goldberg","raw_affiliation_strings":["Microsoft Research - Silicon Valley, Mountain View, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research - Silicon Valley, Mountain View, CA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210086253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063407134","display_name":"Renato F. Werneck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Renato Werneck","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.8128,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.99133663,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"93","last_page":"139"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6852990388870239},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6376814842224121},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6299217939376831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.601669430732727},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5982351899147034},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5124555230140686},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.458249032497406},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.43629857897758484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3153427839279175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2626394033432007},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13996711373329163}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6852990388870239},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6376814842224121},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6299217939376831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.601669430732727},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5982351899147034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5124555230140686},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.458249032497406},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.43629857897758484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3153427839279175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2626394033432007},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13996711373329163},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/074/05","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/05","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W27247825","https://openalex.org/W30435042","https://openalex.org/W47153646","https://openalex.org/W85206208","https://openalex.org/W127515624","https://openalex.org/W190901240","https://openalex.org/W1489554686","https://openalex.org/W1493214567","https://openalex.org/W1510642760","https://openalex.org/W1513400187","https://openalex.org/W1520740947","https://openalex.org/W1528485123","https://openalex.org/W1537256577","https://openalex.org/W1550136763","https://openalex.org/W1559814459","https://openalex.org/W1561240874","https://openalex.org/W1583434898","https://openalex.org/W1810931192","https://openalex.org/W1866249310","https://openalex.org/W1964119857","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1982440947","https://openalex.org/W1999545213","https://openalex.org/W2003457914","https://openalex.org/W2014889099","https://openalex.org/W2056403031","https://openalex.org/W2069916913","https://openalex.org/W2077383738","https://openalex.org/W2084224084","https://openalex.org/W2100586428","https://openalex.org/W2127470768","https://openalex.org/W2144050074","https://openalex.org/W2151400766","https://openalex.org/W2169528473","https://openalex.org/W2180471588","https://openalex.org/W2184615329","https://openalex.org/W2439405256","https://openalex.org/W2548579856","https://openalex.org/W2576197549","https://openalex.org/W2768149714","https://openalex.org/W3015760390","https://openalex.org/W3137299218","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"We":[0,57,74],"study":[1],"the":[2,41,78,83,87,121,133,156],"point-to-point":[3],"shortest":[4,55],"path":[5],"problem":[6],"with":[7,52,100,171],"preprocessing.":[8],"Given":[9],"an":[10,34],"input":[11],"graph,":[12],"we":[13,95],"preprocess":[14],"it":[15],"so":[16],"as":[17],"to":[18,21,54,82,104,154],"be":[19],"able":[20],"answer":[22],"a":[23,59,97,106,152],"series":[24],"of":[25,36,43,62,80,89,109,132],"source-to-destination":[26],"queries":[27],"efficiently.":[28],"Our":[29,161],"work":[30],"is":[31,51,124],"motivated":[32],"by":[33],"algorithm":[35,64,99,123,147,162],"Gutman":[37],"[ALENEX\u201904],":[38],"based":[39],"on":[40,144,167],"notion":[42],"reach,":[44],"which":[45],"measures":[46],"how":[47,77],"important":[48],"each":[49],"vertex":[50],"respect":[53],"paths.":[56],"present":[58],"simplified":[60],"version":[61],"his":[63],"that":[65],"does":[66],"not":[67],"require":[68],"explicit":[69],"lower":[70],"bounds":[71],"during":[72],"queries.":[73,93],"also":[75,163],"show":[76],"addition":[79],"shortcuts":[81],"graph":[84],"greatly":[85],"improves":[86],"performance":[88],"both":[90],"preprocessing":[91],"and":[92,127,135],"Finally,":[94],"combine":[96],"reach-based":[98],"landmark-based":[101],"A":[102],"search":[103],"obtain":[105],"wide":[107],"range":[108],"space-time":[110],"trade-offs.":[111],"For":[112],"our":[113,146],"motivating":[114],"application,":[115],"driving":[116],"directions":[117],"for":[118],"road":[119,130],"networks,":[120],"resulting":[122],"very":[125],"efficient":[126],"practical.":[128],"The":[129],"networks":[131],"USA":[134],"Western":[136],"Europe":[137],"have":[138],"roughly":[139],"20":[140],"million":[141],"vertices,":[142],"but":[143],"average":[145],"must":[148],"visit":[149],"fewer":[150],"than":[151],"thousand":[153],"find":[155],"distance":[157],"between":[158],"two":[159],"points.":[160],"works":[164],"reasonably":[165],"well":[166],"2-dimensional":[168],"grid":[169],"graphs":[170],"random":[172],"arc":[173],"weights.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}