{"id":"https://openalex.org/W2609578772","doi":"https://doi.org/10.1090/dimacs/074","title":"The Shortest Path Problem","display_name":"The Shortest Path Problem","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2609578772","doi":"https://doi.org/10.1090/dimacs/074","mag":"2609578772"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074","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":"monograph"},"type":"book","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/A5066534034","display_name":"Camil Demetrescu","orcid":"https://orcid.org/0000-0002-4686-6745"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Demetrescu, Camil","raw_affiliation_strings":["Sapienza Universit\u00c3\u00a1 di Roma, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Sapienza Universit\u00c3\u00a1 di Roma, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","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":"Goldberg, Andrew","raw_affiliation_strings":["Microsoft Research - Silicon Valley, Mountain View, CA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research - Silicon Valley, Mountain View, CA","institution_ids":["https://openalex.org/I4210086253","https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Johnson, David","raw_affiliation_strings":["AT&T Labs - Research, Florham Park, NJ"],"affiliations":[{"raw_affiliation_string":"AT&T Labs - Research, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066534034"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":1.7791,"has_fulltext":false,"cited_by_count":132,"citation_normalized_percentile":{"value":0.83064516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"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.9785000085830688,"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.9785000085830688,"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.9287999868392944,"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/path","display_name":"Path (computing)","score":0.5445071458816528},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4676344692707062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4349541664123535},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12060233950614929},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11850437521934509}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5445071458816528},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4676344692707062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4349541664123535},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12060233950614929},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11850437521934509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/074","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074","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":"monograph"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2023505575","https://openalex.org/W2373437113","https://openalex.org/W2125453582","https://openalex.org/W2317449002","https://openalex.org/W3106476875","https://openalex.org/W2384974102","https://openalex.org/W2316925676","https://openalex.org/W2384965074","https://openalex.org/W2955916906"],"abstract_inverted_index":{"Shortest":[0,53],"path":[1,54,99],"problems":[2,10],"are":[3],"among":[4],"the":[5,60,74,81,92,95,105,111,131,149],"most":[6,150],"fundamental":[7],"combinatorial":[8],"optimization":[9],"with":[11],"many":[12],"applications,":[13],"both":[14],"direct":[15],"and":[16,50,62,123],"as":[17,118,120,141],"subroutines.":[18],"They":[19],"arise":[20],"naturally":[21],"in":[22,97,110,153],"a":[23],"remarkable":[24],"number":[25],"of":[26,68,91,94,130,148],"real-world":[27,155],"settings.":[28,156],"A":[29],"limited":[30],"list":[31],"includes":[32],"transportation":[33],"planning,":[34],"network":[35],"optimization,":[36],"packet":[37],"routing,":[38],"image":[39],"segmentation,":[40],"speech":[41],"recognition,":[42],"document":[43],"formatting,":[44],"robotics,":[45],"compilers,":[46],"traffic":[47],"information":[48],"systems,":[49,144],"dataflow":[51],"analysis.":[52],"algorithms":[55,152],"have":[56],"been":[57],"studied":[58],"since":[59],"1950's":[61],"still":[63],"remain":[64],"an":[65],"active":[66],"area":[67],"research.":[69],"This":[70],"volume":[71],"reports":[72],"on":[73],"research":[75,109],"carried":[76],"out":[77],"by":[78],"participants":[79],"during":[80,104],"Ninth":[82],"DIMACS":[83],"Implementation":[84],"Challenge,":[85],"which":[86],"led":[87],"to":[88,114,121],"several":[89,154],"improvements":[90],"state":[93],"art":[96],"shortest":[98],"algorithms.":[100],"The":[101,128],"infrastructure":[102],"developed":[103],"Challenge":[106,132],"facilitated":[107],"further":[108],"area,":[112],"leading":[113],"substantial":[115],"follow-up":[116],"work":[117],"well":[119],"better":[122],"more":[124],"uniform":[125],"experimental":[126,146],"standards.":[127],"results":[129],"included":[133],"new":[134],"cutting-edge":[135],"techniques":[136],"for":[137],"emerging":[138],"applications":[139],"such":[140],"GPS":[142],"navigation":[143],"providing":[145],"evidence":[147],"effective":[151]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2017-05-05T00:00:00"}