{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:51Z","timestamp":1759638831590},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_38","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"431-442","source":"Crossref","is-referenced-by-count":6,"title":["Approximation Algorithms for Minimum Size 2-Connectivity Problems"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S. Anil","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"38_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 6th IPCO","author":"R. Carr","year":"1998","unstructured":"R. Carr and R. Ravi. A new bound for the 2-edge connected subgraph problem. In the Proc. 6th IPCO, LNCS 1412, 1998."},{"key":"38_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 6th IPCO","author":"J. Cheriyan","year":"1998","unstructured":"J. Cheriyan, A. Seb\u0151 and Z. Szigeti. An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. In the Proc. 6th IPCO, LNCS 1412, 1998."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0931","volume":"28","author":"C.G. Fernandes","year":"1998","unstructured":"C.G. Fernandes. A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem. Journal of Algorithms, 28, pp. 105\u2013124, 1998.","journal-title":"Journal of Algorithms"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01202790","volume":"13","author":"A. Frank","year":"1993","unstructured":"A. Frank. Conservative weightings and ear-decompositions of graphs. Combinatorica, 13, pp. 65\u201381, 1993.","journal-title":"Combinatorica"},{"key":"38_CR5","unstructured":"N. Garg, V. Santosh and A. Singla. Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. In the Proc. 4th ACM-SIAM SODA, pp. 103\u2013111, 1993."},{"key":"38_CR6","unstructured":"M.X. Goemans, A. Goldberg, S. Plotkin, D.B. Shmoys, \u00c8. Tardos and D.P. Williamson. Improved Approximation Algorithms for Network Design Problems. In the Proc. 5th ACMSIAM SODA, pp. 223\u2013232, 1994."},{"key":"38_CR7","unstructured":"R.L. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz, editors. Handbook of Combinatorics. Volume I. North-Holland, 1995."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"M. Grigni, E. Koutsoupias and C.H. Papadimitriou. An approximation scheme for planar graph TSP. In the Proc. of the IEEE FOCS, 1995.","DOI":"10.1109\/SFCS.1995.492665"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C. Monma and M. Stoer. Design of survivable networks. In Handbook in Operations Research and Management Science, Volume on Networks. North-Holland, 1995.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"38_CR10","unstructured":"K. Jain. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. In the Proc. of the IEEE FOCS, 1998."},{"issue":"2","key":"38_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin. Biconnectivity Approximations and Graph Carvings. Journal of the ACM, 41(2), pp. 214\u2013235, 1994.","journal-title":"Journal of the ACM"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7, pp. 583\u2013596, 1992.","journal-title":"Algorithmica"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02523686","volume":"18","author":"R. Ravi","year":"1997","unstructured":"R. Ravi and D.P. Williamson. An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica, 18(1), pp. 21\u201343, 1997.","journal-title":"Algorithmica"},{"key":"38_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 3rd International Workshop APPROX","author":"S. Vempala","year":"2000","unstructured":"S. Vempala and A. Vetta. Factor 4\/3 Approximations for Minimum 2-Connected Subgraphs. In the Proc. 3rd International Workshop APPROX, LNCS 1913, 2000."}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:29:45Z","timestamp":1556501385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}