{"id":"https://openalex.org/W2014889099","doi":"https://doi.org/10.5555/1070432.1070455","title":"Computing the shortest path: A search meets graph theory","display_name":"Computing the shortest path: A search meets graph theory","publication_year":2005,"publication_date":"2005-01-23","ids":{"openalex":"https://openalex.org/W2014889099","doi":"https://doi.org/10.5555/1070432.1070455","mag":"2014889099"},"language":"en","primary_location":{"id":"mag:2014889099","doi":"https://doi.org/10.5555/1070432.1070455","is_oa":false,"landing_page_url":"https://research.microsoft.com/pubs/154937/soda05.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2014889099"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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,"observed_orcids":[]},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["[Microsoft Research, Mountain View, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Microsoft Research, Mountain View, CA]","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041036764","display_name":"Chris Harrelson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Harrelson","raw_affiliation_strings":["UC BERKELEY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC BERKELEY","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.6563,"has_fulltext":false,"cited_by_count":743,"citation_normalized_percentile":{"value":0.9980926,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9086999893188477,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9086999893188477,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.07199999690055847,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7129999995231628},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.9580000042915344},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.9210000038146973},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"bidirectional search","score":0.7480000257492065},{"id":"https://openalex.org/keywords/graph-preprocessing","display_name":"graph preprocessing","score":0.6949999928474426},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.9959999918937683},{"id":"https://openalex.org/keywords/shortest-path-queries","display_name":"shortest path queries","score":0.859000027179718},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.968999981880188},{"id":"https://openalex.org/keywords/driving-directions","display_name":"driving directions","score":0.8709999918937683},{"id":"https://openalex.org/keywords/graph-search-algorithms","display_name":"graph search algorithms","score":0.37299999594688416}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7126979231834412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.603966474533081},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6010469198226929},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5674757957458496},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5323026180267334},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.48982760310173035},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4710395634174347},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4424506425857544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42438963055610657},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4225788712501526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4217658042907715},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.415978342294693},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41291943192481995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40126845240592957},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39151817560195923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3355002999305725},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.32669126987457275},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.29166507720947266},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20663109421730042},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.196211040019989},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1263638436794281}],"mesh":[],"locations_count":3,"locations":[{"id":"mag:2014889099","doi":"https://doi.org/10.5555/1070432.1070455","is_oa":false,"landing_page_url":"https://research.microsoft.com/pubs/154937/soda05.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.1062","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.1062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/research/sv/sv-pubs/msr-tr-2004-24.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.3715","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~chrishtr/papers/msr-tr-2004-24.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W25288802","https://openalex.org/W27247825","https://openalex.org/W30435042","https://openalex.org/W85206208","https://openalex.org/W127515624","https://openalex.org/W273656381","https://openalex.org/W1510642760","https://openalex.org/W1513400187","https://openalex.org/W1537256577","https://openalex.org/W1550136763","https://openalex.org/W1561240874","https://openalex.org/W1964119857","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1971267722","https://openalex.org/W1996805805","https://openalex.org/W1999545213","https://openalex.org/W2003457914","https://openalex.org/W2023624803","https://openalex.org/W2048815087","https://openalex.org/W2056403031","https://openalex.org/W2069916913","https://openalex.org/W2077383738","https://openalex.org/W2083355299","https://openalex.org/W2084224084","https://openalex.org/W2096304547","https://openalex.org/W2100586428","https://openalex.org/W2127470768","https://openalex.org/W2144050074","https://openalex.org/W2168555292","https://openalex.org/W2169528473","https://openalex.org/W2548579856","https://openalex.org/W2752885492","https://openalex.org/W2768149714","https://openalex.org/W2798016460","https://openalex.org/W3015760390","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W7100587016","https://openalex.org/W7096189060","https://openalex.org/W47153646","https://openalex.org/W7096346957","https://openalex.org/W2575116237","https://openalex.org/W2132044905","https://openalex.org/W2185114784","https://openalex.org/W7095387893","https://openalex.org/W1520740947","https://openalex.org/W6903955039"],"abstract_inverted_index":{"We":[0,30,77,116,147],"study":[1],"the":[2,33,74,92,122],"problem":[3,20],"of":[4,26,39,83,91,125],"finding":[5],"a":[6,13,36,65,141],"shortest":[7,52,108],"path":[8,53],"between":[9],"two":[10],"vertices":[11],"in":[12,62,102,132],"directed":[14,114],"graph.":[15,115],"This":[16],"is":[17],"an":[18],"important":[19],"with":[21,64,137,150],"many":[22],"applications,":[23],"including":[24],"that":[25,98,121],"computing":[27],"driving":[28],"directions.":[29],"allow":[31],"preprocessing":[32],"graph":[34,153],"using":[35,47],"linear":[37],"amount":[38],"extra":[40],"space":[41],"to":[42,50,95],"store":[43],"auxiliary":[44],"information,":[45],"and":[46,73,87,110],"this":[48],"information":[49],"answer":[51],"queries":[54],"quickly.":[55],"Our":[56,104],"approach":[57],"uses":[58],"A":[59,84,134],"\u2217":[60,85,135],"search":[61,86,136],"combination":[63],"new":[66,80,93,127],"graph-theoretic":[67],"lower-bounding":[68],"technique":[69],"based":[70],"on":[71,112,144],"landmarks":[72],"triangle":[75],"inequality.":[76],"also":[78,148],"develop":[79],"bidirectional":[81],"variants":[82,90],"investigate":[88],"several":[89,151],"algorithms":[94,105,128],"find":[96],"those":[97],"are":[99],"most":[100,123],"efficient":[101,124],"practice.":[103],"compute":[106],"optimal":[107],"paths":[109],"work":[111],"any":[113],"give":[117],"experimental":[118],"results":[119],"showing":[120],"our":[126],"outperforms":[129],"previous":[130],"algorithms,":[131],"particular":[133],"Euclidean":[138],"bounds,":[139],"by":[140],"wide":[142],"margin":[143],"road":[145],"networks.":[146],"experiment":[149],"synthetic":[152],"families.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":25},{"year":2023,"cited_by_count":24},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":58},{"year":2020,"cited_by_count":33},{"year":2019,"cited_by_count":50},{"year":2018,"cited_by_count":38},{"year":2017,"cited_by_count":39},{"year":2016,"cited_by_count":47},{"year":2015,"cited_by_count":57},{"year":2014,"cited_by_count":41},{"year":2013,"cited_by_count":52},{"year":2012,"cited_by_count":35}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}