{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:21Z","timestamp":1759638081678,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_13","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"90-101","source":"Crossref","is-referenced-by-count":15,"title":["A 3\/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s004530010009","volume":"27","author":"R. Bar-Yehuda","year":"2000","unstructured":"R. Bar-Yehuda, \u201cOne for the Price of Two: A Unified Approach for Approximating Covering Problems\u201d, Algorithmica 27(2), 2000, 131\u2013144.","journal-title":"Algorithmica"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/3-540-48481-7_44","volume-title":"ESA\u201999","author":"J. Cheriyan","year":"1999","unstructured":"J. Cheriyan, T. Jord\u00e1n, and R. Ravi, \u201cOn 2-coverings and 2-packing of laminar families\u201d, Lecture Notes in Computer Science, 1643, Springer Verlag, ESA\u201999, (1999), 510\u2013520."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-69346-7_10","volume-title":"IPCO\u201998","author":"J. Cheriyan","year":"1998","unstructured":"J. Cheriyan, A. Seb\u00f6, and Z. Szigeti, \u201cAn improved approximation algorithm for minimum size 2-edge connected spanning subgraphs\u201d, Lecture Notes in Computer Science, 1412, Springer Verlag, IPCO\u201998, (1998), 126\u2013136."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. P. Eswaran","year":"1976","unstructured":"K. P. Eswaran and R. E. Tarjan, \u201cAugmentation Problems\u201d, SI AM J. Computing, 5 (1976), 653\u2013665.","journal-title":"SI AM J. Computing"},{"unstructured":"A. Frank, \u201cConnectivity Augmentation Problems in Network Design\u201d, Mathematical Programming, State of the Art, Ed. J. R. Birge and K. G. Murty, 1994, 34\u201363.","key":"13_CR5"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, \u201cAugmenting Graphs to Meet Edge-Connectivity Requirements\u201d, SI AM Journal on Discrete Mathematics, 5 (1992), 25\u201353.","journal-title":"SI AM Journal on Discrete Mathematics"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G. N. Frederickson","year":"1981","unstructured":"G. N. Frederickson and J. J\u00e1j\u00e1, \u201cApproximation algorithms for several graph augmentation problems\u201d, SI AM J. Computing, 10 (1981), 270\u2013283.","journal-title":"SI AM J. Computing"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson, \u201cA General Approximation Technique for Constrained Forest Problems\u201d, SI AM J. on Computing, 24, 1995, 296\u2013317.","journal-title":"SI AM J. on Computing"},{"doi-asserted-by":"crossref","unstructured":"Kamal Jain, \u201cFactor 2 Approximation Algorithm for the Generalized Steiner Network Problem\u201d, FOCS 1998, 448\u2013457.","key":"13_CR9","DOI":"10.1109\/SFCS.1998.743495"},{"doi-asserted-by":"crossref","unstructured":"H. Nagamochi, \u201cAn approximation for finding a smallest 2-edge connected subgraph containing a specified spanning tree\u201d, TR #99019, (1999), Kyoto University, Kyoto, Japan. http:\/\/www.kuamp.kyoto-u.ac.jp\/labs\/or\/members\/naga\/TC\/99019.ps","key":"13_CR10","DOI":"10.1007\/3-540-48686-0_3"},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48686-0_3","volume-title":"5th Annual International Computing and Combinatorics Conference","author":"H. Nagamochi","year":"1999","unstructured":"H. Nagamochi and T. Ibaraki, \u201cAn approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree\u201d, Lecture Notes In Computer Science, vol. 1627, Springer-Verlag, 5th Annual International Computing and Combinatorics Conference, July 26\u201328, Tokyo, Japan, (1999) 31\u201340."},{"key":"13_CR12","volume-title":"Approximation algorithms for NP-hard problems","author":"S. Khuller","year":"1996","unstructured":"S. Khuller, Approximation algorithms for finding highly connected subgraphs, In Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS Publishing Boston, 1996."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S. Khuller","year":"1993","unstructured":"S. Khuller and R. Thurimella, \u201cApproximation algorithms for graph augmentation\u201d, J. of Algorithms, 14 (1993), 214\u2013225.","journal-title":"J. of Algorithms"},{"unstructured":"S. Vempala and A. Vetta, \u201cOn the minimum 2-edge connected subgraph\u201d, Proc. of the 3rd Workshop on Approximation, Saarbr\u00fcucken, 2000.","key":"13_CR14"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:48:09Z","timestamp":1736988489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}