{"id":"https://openalex.org/W2014682451","doi":"https://doi.org/10.1137/s0097539796298340","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":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2014682451","doi":"https://doi.org/10.1137/s0097539796298340","mag":"2014682451"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796298340","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796298340","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","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":4.1014,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.94488433,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"492","last_page":"514"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9997000098228455,"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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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/time-complexity","display_name":"Time complexity","score":0.5901300311088562},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5832939743995667},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5539431571960449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5478068590164185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4956303834915161},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4606807827949524},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44753411412239075},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41699856519699097},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36961257457733154}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5901300311088562},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5832939743995667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5539431571960449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5478068590164185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4956303834915161},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4606807827949524},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44753411412239075},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41699856519699097},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36961257457733154},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796298340","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796298340","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1998076865","https://openalex.org/W2007746582","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/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2031098440","https://openalex.org/W4307385446","https://openalex.org/W2466894780","https://openalex.org/W4292622033","https://openalex.org/W3174360887","https://openalex.org/W2030016043","https://openalex.org/W2118030071","https://openalex.org/W1563905845"],"abstract_inverted_index":{"The":[0,19],"classic":[1],"all-terminal":[2],"network":[3,28],"reliability":[4],"problem":[5,36,48],"posits":[6],"a":[7,58,76,110,121],"graph,":[8],"each":[9],"of":[10,43,61,113,129,138],"whose":[11],"edges":[12],"fails":[13],"independently":[14],"with":[15,87,115],"some":[16],"given":[17,83],"probability.":[18,70,117],"goal":[20],"is":[21,49,106],"to":[22,32,55,66,108,135,150],"determine":[23],"the":[24,27,41,47,68,102,127,152],"probability":[25,104],"that":[26,105],"becomes":[29],"disconnected":[30],"due":[31],"edge":[33],"failures.":[34],"This":[35],"has":[37,63],"obvious":[38],"applications":[39],"in":[40,92,95,142],"design":[42],"communication":[44],"networks.":[45],"Since":[46],"$\\SP$-complete":[50],"and":[51,97,146,149],"thus":[52],"believed":[53],"hard":[54],"solve":[56],"exactly,":[57],"great":[59],"deal":[60],"research":[62],"been":[64],"devoted":[65],"estimating":[67],"failure":[69,89,103,131],"In":[71],"this":[72],"paper,":[73],"we":[74],"give":[75,120],"fully":[77],"polynomial":[78,94,123,154],"randomized":[79],"approximation":[80,124],"scheme":[81,125],"that,":[82],"any":[84],"n-vertex":[85],"graph":[86],"specified":[88],"probabilities,":[90],"computes":[91],"time":[93],"n":[96],"$1/\\epsilon$":[98],"an":[99],"estimate":[100],"for":[101,126],"accurate":[107],"within":[109],"relative":[111],"error":[112],"$1\\pm\\epsilon$":[114],"high":[116],"We":[118],"also":[119,156],"deterministic":[122],"case":[128],"small":[130],"probabilities.":[132],"Some":[133],"extensions":[134],"evaluating":[136,151],"probabilities":[137],"k-connectivity,":[139],"strong":[140],"connectivity":[141],"directed":[143],"Eulerian":[144],"graphs":[145],"r-way":[147],"disconnection,":[148],"Tutte":[153],"are":[155],"described.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}