{"id":"https://openalex.org/W1998002108","doi":"https://doi.org/10.5555/1873601.1873662","title":"A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs","display_name":"A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-17","ids":{"openalex":"https://openalex.org/W1998002108","doi":"https://doi.org/10.5555/1873601.1873662","mag":"1998002108"},"language":"en","primary_location":{"id":"mag:1998002108","doi":"https://doi.org/10.5555/1873601.1873662","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973075.61","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/W1998002108"],"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/A5033889707","display_name":"Aaron Bernstein","orcid":"https://orcid.org/0000-0002-7599-2679","observed_orcids":["https://orcid.org/0000-0002-7599-2679"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambrdige, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambrdige, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.6221,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9346541,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"742","last_page":"755"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.0,"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.0,"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/replacement-paths","display_name":"replacement paths","score":0.9850000143051147},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7440000176429749},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.9279999732971191},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6990000009536743}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.784186840057373},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7574174404144287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6594396233558655},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5953360795974731},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5628188848495483},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5284923315048218},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4896262288093567},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4879254996776581},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4840833246707916},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.48101502656936646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47683635354042053},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.47104787826538086},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4380887746810913},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43335115909576416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3907148838043213},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2877236604690552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1675223410129547},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1998002108","doi":"https://doi.org/10.5555/1873601.1873662","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973075.61","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.215.1943","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/soda/2010/SODA10_061_bernsteina.pdf","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":15,"referenced_works":["https://openalex.org/W326304601","https://openalex.org/W1577501260","https://openalex.org/W1773616669","https://openalex.org/W1900943336","https://openalex.org/W1980943820","https://openalex.org/W1984407615","https://openalex.org/W2012634103","https://openalex.org/W2075543862","https://openalex.org/W2079318435","https://openalex.org/W2084224084","https://openalex.org/W2094099891","https://openalex.org/W2121601357","https://openalex.org/W2131058166","https://openalex.org/W2134729426","https://openalex.org/W2766824301"],"related_works":["https://openalex.org/W2094099891","https://openalex.org/W1773616669","https://openalex.org/W2110004664","https://openalex.org/W2075543862","https://openalex.org/W2164276198","https://openalex.org/W7095605298","https://openalex.org/W7097017247","https://openalex.org/W1980889962","https://openalex.org/W2041299693","https://openalex.org/W2963203140"],"abstract_inverted_index":{"Let":[0],"G":[1],"=":[2,156,257,276],"(V,":[3],"E)":[4],"be":[5,16,27,66],"a":[6,74,88,202,226,267,291,296],"directed":[7,127,203],"graph":[8,169,204],"with":[9,129,205],"positive":[10,130,206],"edge":[11,44,70,131,165,207],"weights,":[12],"let":[13,24],"s,":[14],"t":[15,55,82,199,239],"two":[17],"specified":[18],"vertices":[19,342],"in":[20,126,147,167,201,323],"this":[21,63,86,104,264],"graph,":[22],"and":[23,76,99,170,295],"\u03c0(s,":[25,47],"t)":[26],"the":[28,34,49,78,119,163,168,173,188,193,220,232,320,324,333],"shortest":[29,50,79,195,235],"path":[30,51,83,222],"between":[31],"them.":[32],"In":[33],"replacement":[35,124,145,306,337],"paths":[36,125,146,200,326,338],"problem":[37,64,190,265],"we":[38,223,340],"want":[39],"to":[40,54,62,67,105,231],"compute,":[41],"for":[42,123,187,263,305,319],"every":[43],"e":[45],"on":[46],"t),":[48],"from":[52],"s":[53,80,197,237],"that":[56,309],"avoids":[57],"e.":[58],"The":[59,241,259,279],"naive":[60],"solution":[61],"would":[65],"remove":[68],"each":[69,84],"e,":[71],"one":[72],"at":[73],"time,":[75,159],"compute":[77],"\u2212":[81,198,238],"time;":[85],"yields":[87],"running":[89,242,268,297,313],"time":[90,243,269,298],"of":[91,191,244,270,293,299,311,335,344],"O(mn":[92],"+":[93,143,183,228,253],"n":[94,152,254],"2":[95,107,151,251,272],"log":[96,108,109,150,154,250,255,273,274],"n).":[97],"Gotthilf":[98],"Lewenstein":[100],"[8]":[101],"recently":[102],"improved":[103],"O(mn+n":[106],"n),":[110],"but":[111],"no":[112],"o(mn)":[113],"algorithms":[114],"are":[115,315],"known.":[116],"We":[117,176],"present":[118,178],"first":[120],"approximation":[121,230,282],"algorithm":[122,140,186,212,246,262,283,330],"graphs":[128],"weights.":[132,208],"Given":[133],"any":[134],"\u025b":[135],"\u2208":[136],"[0,":[137],"1),":[138],"our":[139,211,245,312,329],"returns":[141],"(1":[142,182,227],"\u025b)-approximate":[144],"O(\u025b":[148],"\u22121":[149,249],"log(nC/c)(m+n":[153],"n))":[155,256,275],"\u00d5(m":[157],"log(nC/c)/\u025b)":[158],"where":[160,219,339],"C":[161],"is":[162,172,225,247],"largest":[164],"weight":[166],"c":[171],"smallest":[174],"weight.":[175],"also":[177],"an":[179],"even":[180],"faster":[181],"\u025b)":[184,229],"approximate":[185,336],"simpler":[189],"approximating":[192],"k":[194,214],"simple":[196,216,236],"That":[209],"is,":[210],"outputs":[213],"different":[215],"s\u2212t":[217],"paths,":[218],"kth":[221,234],"output":[224],"actual":[233],"path.":[240],"O(k\u025b":[248],"n(m":[252],"\u00d5(km/\u025b).":[258],"fastest":[260],"exact":[261],"has":[266,290],"O(k(mn+n":[271],"\u00d5(kmn)":[277],"[8].":[278],"previous":[280],"best":[281],"was":[284],"developed":[285],"by":[286],"Roditty":[287],"[15];":[288],"it":[289],"stretch":[292],"3/2":[294],"\u00d5(km\u221an)":[300],"(it":[301],"does":[302],"not":[303],"work":[304],"paths).":[307],"Note":[308],"all":[310],"times":[314],"nearly":[316],"optimal":[317],"except":[318],"O(log(nC/c))":[321],"factor":[322],"replacements":[325],"algorithm.":[327],"Also,":[328],"can":[331],"solve":[332],"variant":[334],"avoid":[341],"instead":[343],"edges.":[345],"1":[346]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1998002108","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
