{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:03Z","timestamp":1725600303752},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_13","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:20:39Z","timestamp":1313140839000},"page":"147-157","source":"Crossref","is-referenced-by-count":0,"title":["A (1\u2009+\u2009ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius"],"prefix":"10.1007","author":[{"given":"Nachshon","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/3-540-48481-7_44","volume-title":"Algorithms - ESA\u201999","author":"J. Cheriyan","year":"1999","unstructured":"Cheriyan, J., Jord\u00e1n, T., Ravi, R.: On 2-coverings and 2-packings of laminar families. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 510\u2013520. Springer, Heidelberg (1999)"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2008.01.009","volume":"36","author":"J. Cheriyan","year":"2008","unstructured":"Cheriyan, J., Karloff, H., Khandekar, R., K\u00f6nemann, J.: On the integrality ratio for tree augmentation. Operations Research Letters\u00a036(4), 399\u2013401 (2008)","journal-title":"Operations Research Letters"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ipl.2010.12.010","volume":"111","author":"G. Even","year":"2011","unstructured":"Even, G., Kortsarz, G., Nutov, Z.: A 1.5 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Information Processing Letters\u00a0111(6), 296\u2013300 (2011)","journal-title":"Information Processing Letters"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"G.N. Fredrickson","year":"1982","unstructured":"Fredrickson, G.N., J\u00e1j\u00e1, J.: On the relationship between the biconnectivity augmentation and traveling salesman problem. Theorethical Computer Science\u00a019(2), 189\u2013201 (1982)","journal-title":"Theorethical Computer Science"},{"key":"13_CR5","unstructured":"Goemans, M., Williamson, D.: The primal dual method for approximation algorithms and its applications to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, ch. 4, pp. 144\u2013191. PWS (1995)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"13_CR7","unstructured":"Khuller, S.: Approximation algorithms for for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard problems, ch. 6, pp. 236\u2013265. PWS (1995)"},{"key":"13_CR8","volume-title":"Approximation Algorithms and Metahueristics","author":"G. Kortsarz","year":"2007","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzales, T.F. (ed.) Approximation Algorithms and Metahueristics, ch. 58. CRC, Boca Raton (2007)"},{"issue":"13","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1016\/j.dam.2010.04.002","volume":"158","author":"Y. Maduel","year":"2010","unstructured":"Maduel, Y., Nutov, Z.: Covering a laminar family by leaf to leaf links. Discrete Applied Mathematics\u00a0158(13), 1424\u20131432 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00218-4","volume":"126","author":"H. Nagamochi","year":"2003","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge connected subgraph containing a specified spanning tree. Discrete Applied Mathematics\u00a0126, 83\u2013113 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR11","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2004","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Heidelberg (2004)"},{"key":"13_CR12","unstructured":"Zelikovsky, A.: Better approximation bounds for the network and euclidean steiner tree problems. Technical report (1995)"}],"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\/978-3-642-22935-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T12:12:37Z","timestamp":1554034357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}