{"id":"https://openalex.org/W2049745956","doi":"https://doi.org/10.1145/1498698.1537602","title":"Shortest-path feasibility algorithms","display_name":"Shortest-path feasibility algorithms","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2049745956","doi":"https://doi.org/10.1145/1498698.1537602","mag":"2049745956"},"language":"en","primary_location":{"id":"doi:10.1145/1498698.1537602","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537602","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/A5045036830","display_name":"Boris V. Cherkassky","orcid":null},"institutions":[{"id":"https://openalex.org/I2802368776","display_name":"Central Economics and Mathematics Institute","ror":"https://ror.org/02n937p61","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2802368776","https://openalex.org/I4210120228"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris V. Cherkassky","raw_affiliation_strings":["Central Economics and Mathematics Institute of the Russian Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central Economics and Mathematics Institute of the Russian Academy of Sciences","institution_ids":["https://openalex.org/I2802368776"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["University of Western Macedonia, Kozani, Greece","University of Western Macedonia Kozani, Greece#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]},{"raw_affiliation_string":"University of Western Macedonia Kozani, Greece#TAB#","institution_ids":["https://openalex.org/I89506807"]}]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Microsoft Research, Mountain View, CA","[Microsoft Research, Mountain View, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Mountain View, CA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"[Microsoft Research, Mountain View, CA]","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063407134","display_name":"Renato F. Werneck","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato F. Werneck","raw_affiliation_strings":["Microsoft Research, Mountain View, CA","[Microsoft Research, Mountain View, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Mountain View, CA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"[Microsoft Research, Mountain View, CA]","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3887,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.81015662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":null,"first_page":null,"last_page":null},"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.9990000128746033,"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.9990000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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/testbed","display_name":"Testbed","score":0.6970080733299255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6196760535240173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6038663387298584},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5926269888877869},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.502544641494751},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4678032696247101},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43749842047691345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2660534679889679}],"concepts":[{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.6970080733299255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6196760535240173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6038663387298584},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5926269888877869},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.502544641494751},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4678032696247101},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43749842047691345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2660534679889679},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1498698.1537602","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537602","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":[{"id":"https://openalex.org/G8776428821","display_name":null,"funder_award_id":"CCF-0830676CCF-0832797","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W342309696","https://openalex.org/W1426993502","https://openalex.org/W1505487858","https://openalex.org/W1513400187","https://openalex.org/W1521201031","https://openalex.org/W1547091276","https://openalex.org/W1561880747","https://openalex.org/W1677133548","https://openalex.org/W1964119857","https://openalex.org/W1964416868","https://openalex.org/W1983093080","https://openalex.org/W1985882632","https://openalex.org/W1990678352","https://openalex.org/W2061159212","https://openalex.org/W2061632451","https://openalex.org/W2062266989","https://openalex.org/W2069916913","https://openalex.org/W2074792936","https://openalex.org/W2084224084","https://openalex.org/W2118382442","https://openalex.org/W2130182605","https://openalex.org/W2133527541","https://openalex.org/W2155911206","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2222522247","https://openalex.org/W2227557434","https://openalex.org/W3015760390","https://openalex.org/W3137299218","https://openalex.org/W3138807513","https://openalex.org/W4245630182","https://openalex.org/W4285719527","https://openalex.org/W6630969974","https://openalex.org/W6724006179","https://openalex.org/W6792319920"],"related_works":["https://openalex.org/W2883256816","https://openalex.org/W2171408034","https://openalex.org/W3003320923","https://openalex.org/W4387860419","https://openalex.org/W2267666206","https://openalex.org/W2498592833","https://openalex.org/W2396978051","https://openalex.org/W4390436776","https://openalex.org/W3016558738","https://openalex.org/W4210508727"],"abstract_inverted_index":{"This":[0],"is":[1,38],"an":[2],"experimental":[3],"study":[4,30],"of":[5,81],"algorithms":[6],"for":[7],"the":[8,79,82,85],"shortest-path":[9],"feasibility":[10],"problem:":[11],"Given":[12],"a":[13,18,23,64],"directed":[14],"weighted":[15],"graph,":[16],"find":[17],"negative":[19],"cycle":[20],"or":[21],"present":[22],"short":[24],"proof":[25],"that":[26],"none":[27],"exists.":[28],"We":[29,56],"previously":[31,43],"known":[32],"and":[33,48],"new":[34,68],"algorithms.":[35],"Our":[36,76],"testbed":[37],"more":[39],"extensive":[40],"than":[41],"those":[42],"used,":[44],"including":[45],"both":[46],"static":[47],"incremental":[49],"problems,":[50],"as":[51,53],"well":[52],"worst-case":[54],"instances.":[55],"show":[57],"that,":[58],"while":[59],"no":[60],"single":[61],"algorithm":[62],"dominates,":[63],"small":[65],"subset":[66],"(including":[67],"algorithms)":[69],"has":[70],"very":[71],"robust":[72],"performance":[73],"in":[74,84],"practice.":[75],"work":[77],"advances":[78],"state":[80],"art":[83],"area.":[86]},"counts_by_year":[{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}