{"id":"https://openalex.org/W1975407578","doi":"https://doi.org/10.1137/s0036144501387141","title":"A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem","display_name":"A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1975407578","doi":"https://doi.org/10.1137/s0036144501387141","mag":"1975407578"},"language":"en","primary_location":{"id":"doi:10.1137/s0036144501387141","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0036144501387141","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","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/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.11495265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"43","issue":"3","first_page":"499","last_page":"522"},"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.9994999766349792,"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.9994999766349792,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9941999912261963,"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/vertex","display_name":"Vertex (graph theory)","score":0.5782872438430786},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5513718128204346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5100765824317932},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5053661465644836},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5049987435340881},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.464460551738739},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4505007863044739},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37419265508651733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3392091393470764}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5782872438430786},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5513718128204346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5100765824317932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5053661465644836},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5049987435340881},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.464460551738739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4505007863044739},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37419265508651733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3392091393470764},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0036144501387141","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0036144501387141","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.3858","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.3858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~karger/Papers/reliability.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.647.314","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.647.314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/reliability-sirev.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.75","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.75","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~karger/Papers/imprel.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1582516383","https://openalex.org/W1964510837","https://openalex.org/W1998076865","https://openalex.org/W2007746582","https://openalex.org/W2014682451","https://openalex.org/W2060137734","https://openalex.org/W2063342497","https://openalex.org/W2094500233","https://openalex.org/W2104410402","https://openalex.org/W2106285343","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2150516767","https://openalex.org/W2168919539"],"related_works":["https://openalex.org/W3123242903","https://openalex.org/W2222736632","https://openalex.org/W4309875728","https://openalex.org/W1534072310","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0,19],"classic":[1],"all-terminal":[2],"network":[3,28],"reliability":[4],"problem":[5,36,48],"posits":[6],"a":[7,60,78,112,123],"graph,":[8],"each":[9],"of":[10,43,63,115,131,140,162],"whose":[11],"edges":[12],"fails":[13],"independently":[14],"with":[15,89,117],"some":[16],"given":[17,85],"probability.":[18,72,119],"goal":[20],"is":[21,49,108],"to":[22,32,57,68,110,137,152],"determine":[23],"the":[24,27,41,47,70,104,129,154,163,171],"probability":[25,106],"that":[26,107,168],"becomes":[29],"disconnected":[30],"due":[31],"edge":[33],"failures.":[34],"This":[35,160],"has":[37,65],"obvious":[38],"applications":[39],"in":[40,94,97,144,170],"design":[42],"communication":[44],"networks.":[45],"Since":[46],"${\\sharp":[50],"{\\cal":[51],"P}}$-complete":[52],"and":[53,99,148,151],"thus":[54],"believed":[55],"hard":[56],"solve":[58],"exactly,":[59],"great":[61],"deal":[62],"research":[64],"been":[66],"devoted":[67],"estimating":[69],"failure":[71,91,105,133],"In":[73],"this":[74],"paper,":[75],"we":[76],"give":[77,122],"fully":[79],"polynomial":[80,96,125,156],"randomized":[81],"approximation":[82,126],"scheme":[83,127],"that,":[84],"any":[86],"n-vertex":[87],"graph":[88],"specified":[90],"probabilities,":[92],"computes":[93],"time":[95],"n":[98],"$1/\\epsilon$":[100],"an":[101],"estimate":[102],"for":[103,128],"accurate":[109],"within":[111],"relative":[113],"error":[114],"$1\\pm\\epsilon$":[116],"high":[118],"We":[120],"also":[121,158],"deterministic":[124],"case":[130],"small":[132],"probabilities.":[134],"Some":[135],"extensions":[136],"evaluating":[138,153],"probabilities":[139],"k-connectivity,":[141],"strong":[142],"connectivity":[143],"directed":[145],"Eulerian":[146],"graphs":[147],"r-way":[149],"disconnection,":[150],"Tutte":[155],"are":[157],"described.":[159],"version":[161],"paper":[164],"corrects":[165],"several":[166],"errata":[167],"appeared":[169],"previous":[172],"journal":[173],"publication":[174],"[D.":[175],"R.":[176],"Karger,":[177],"SIAM":[178],"J.":[179],"Comput.,":[180],"29":[181],"(1999),":[182],"pp.":[183],"492--514].":[184]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}