{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T08:34:00Z","timestamp":1772958840318,"version":"3.50.1"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2019,10,31]]},"abstract":"<jats:p>We present a factor 4\/3 approximation algorithm for the problem of finding a minimum 2-edge connected spanning subgraph of a given undirected multigraph. The algorithm is based upon a reduction to a restricted class of graphs. In these graphs, the approximation algorithm constructs a 2-edge connected spanning subgraph by modifying the smallest 2-edge cover.<\/jats:p>","DOI":"10.1145\/3341599","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T12:20:59Z","timestamp":1570450859000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A 4\/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem"],"prefix":"10.1145","volume":"15","author":[{"given":"Christoph","family":"Hunkenschr\u00f6der","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, USA"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}]}],"member":"320","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199362071"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 10th Symposium on Discrete Algorithms (SODA\u201999)","author":"Czumaj A.","unstructured":"A. Czumaj and A. Lingas . 1999. On approximability of the minimum-cost k-connected spanning subgraph problem . In Proceedings of the 10th Symposium on Discrete Algorithms (SODA\u201999) . 281--290. A. Czumaj and A. Lingas. 1999. On approximability of the minimum-cost k-connected spanning subgraph problem. In Proceedings of the 10th Symposium on Discrete Algorithms (SODA\u201999). 281--290."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0931"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020271"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1091587"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_2_1_8_1","unstructured":"C. Hunkenschr\u00f6der. 2012. Approximationsalgorithmen f\u00fcr 2-kantenzusammenh\u00e4ngende aufspannende subgraphen. M. S. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn.  C. Hunkenschr\u00f6der. 2012. Approximationsalgorithmen f\u00fcr 2-kantenzusammenh\u00e4ngende aufspannende subgraphen. M. S. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 24th Symposium on Theory of Computing (STOC\u201992)","author":"Khuller S.","unstructured":"S. Khuller and U. Vishkin . 1992. Biconnectivity approximations and graph carvings . In Proceedings of the 24th Symposium on Theory of Computing (STOC\u201992) . 759--770. S. Khuller and U. Vishkin. 1992. Biconnectivity approximations and graph carvings. In Proceedings of the 24th Symposium on Theory of Computing (STOC\u201992). 759--770."},{"key":"e_1_2_1_10_1","unstructured":"K. Menger. 1932. Kurventheorie. Teubner Leipzig 221--228.  K. Menger. 1932. Kurventheorie. Teubner Leipzig 221--228."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2960-3"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_26"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:29Z","timestamp":1750200089000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10,31]]}},"alternative-id":["10.1145\/3341599"],"URL":"https:\/\/doi.org\/10.1145\/3341599","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"2017-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}