{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:31:54Z","timestamp":1760016714402,"version":"3.40.5"},"reference-count":26,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1137\/20m1372822","type":"journal-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T19:01:47Z","timestamp":1659034907000},"page":"1730-1747","source":"Crossref","is-referenced-by-count":1,"title":["A $\\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case"],"prefix":"10.1137","volume":"36","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Cheriyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Cummings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Logan","family":"Grout","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1575-9648","authenticated-orcid":true,"given":"Sharat","family":"Ibrahimpur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","published-online":{"date-parts":[[2022,7,28]]},"reference":[{"key":"atypb1","unstructured":"A. Alexander, S. Boyd, and P. Elliott-Magwood,On the Integrality Gap of the 2-Edge Connected Subgraph Problem, Technical Report TR-2006-04, SITE, University of Ottawa, Ottawa, Canada, 2006,http:\/\/www.site.uottawa.ca\/ sylvia\/publications\/AlexanderBoydElliottmagwood2EC.pdf."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197324700"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.10.014"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/110843514"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/16M1057486"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_9"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10033"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0506-y"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0758"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"volume-title":"Oxford Lecture Ser. Math. Appl. 38","year":"2011","author":"Frank A.","key":"atypb11"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580607"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2021.100659"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"atypb16","first-page":"266","volume-title":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms","author":"Jain K.","year":"2003"},{"volume-title":"Fully Dynamic c-Edge Connectivity in Subpolynomial Time, preprint, arXiv:2004.07650 [CS.DS]","year":"2020","author":"Jin W.","key":"atypb17"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384273"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451009"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049699"},{"volume-title":"Masters Thesis","year":"2017","author":"Legault P.","key":"atypb21"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0608"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2960-3"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90028-V"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"M. Thorup,Fully-dynamic min-cut, in Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, pp. 224-230,https:\/\/doi.org\/10.1145\/380752.380804.","DOI":"10.1145\/380752.380804"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120913"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T14:27:24Z","timestamp":1668004044000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1372822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,28]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.1137\/20M1372822"],"URL":"https:\/\/doi.org\/10.1137\/20m1372822","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"type":"print","value":"0895-4801"},{"type":"electronic","value":"1095-7146"}],"subject":[],"published":{"date-parts":[[2022,7,28]]}}}