{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:28Z","timestamp":1740132088494,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Foundation","award":["1718658"],"award-info":[{"award-number":["1718658"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tr.2018.2825232","type":"journal-article","created":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T19:21:16Z","timestamp":1527880876000},"page":"933-950","source":"Crossref","is-referenced-by-count":7,"title":["A Fast and Accurate Failure Frequency Approximation for $k$ -Terminal Reliability Systems"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2069-9264","authenticated-orcid":false,"given":"Anoosheh","family":"Heidarzadeh","sequence":"first","affiliation":[]},{"given":"Alex","family":"Sprintson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1941-1259","authenticated-orcid":false,"given":"Chanan","family":"Singh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref39"},{"year":"2018","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1977.5215078"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TSMCB.2011.2157911","article-title":"A greedy algorithm for faster feasibility evaluation of all-terminal-reliable networks","volume":"41","author":"won","year":"2011","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1970.10481083"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216391"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2009.2020120"},{"journal-title":"The Combinatorics of Network Reliability","year":"1987","author":"colbourn","key":"ref36"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0036144501387141","article-title":"A randomized fully polynomial time approximation scheme for the\n all terminal network reliability problem","volume":"43","author":"karger","year":"2001","journal-title":"SIAM Rev"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/59.780901"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/59.14555"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1979.5220518"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/24.44172"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/24.52639"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/24.126676"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250306"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/24.983397","article-title":"An efficient method for evaluating network reliability with variable link-capacities","volume":"50","author":"lee","year":"2001","journal-title":"IEEE Trans Rel"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2003.816403"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1974.5215262"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(79)90161-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1980.5220821"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.2011854"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1968.292051"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-5726-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1981.5221152"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1981.316364"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1969.5216346"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1979.5220476"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222436"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.4.581"},{"journal-title":"System Reliability Modeling and Evaluation","year":"1977","author":"singh","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222298"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1964.4766068"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.7153\/jmi-02-10"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1981.5221117"},{"key":"ref45","first-page":"141","author":"stoer","year":"1994","journal-title":"A Simple Min Cut Algorithm"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"ref47","first-page":"215","article-title":"On a classical problem of probability theory","volume":"6a","author":"erd\u00f6s","year":"1961","journal-title":"Publ Math Inst Hungarian Acad Sci"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1982.4308860"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/59.336134"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322220"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335422"},{"key":"ref44","first-page":"21","article-title":"Global min-cuts in RNC, and other ramifications of a simple\n min-out algorithm","author":"karger","year":"0","journal-title":"Proc ACM-SIAM Ann Symp Discrete Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00088-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2002.800961"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/24\/8452065\/8362660-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/8452065\/08362660.pdf?arnumber=8362660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:56:02Z","timestamp":1649444162000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8362660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":47,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tr.2018.2825232","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"type":"print","value":"0018-9529"},{"type":"electronic","value":"1558-1721"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}