{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:52:01Z","timestamp":1725486721522},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_20","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"194-205","source":"Crossref","is-referenced-by-count":13,"title":["Approximating Node Connectivity Problems via Set Covers"],"prefix":"10.1007","author":[{"given":"Guy","family":"Kortsarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"R. P. Anstee","year":"1987","unstructured":"R. P. Anstee: A polynomial time algorithm for b-matchings: an alternative approach. Information Processing Letters\n                           24 (1987), 153\u2013157.","journal-title":"Information Processing Letters"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jagm.1999.1006","volume":"32","author":"V. Auletta","year":"1999","unstructured":"V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente, \u201cA 2-approximation algorithm for finding an optimum 3-vertex connected spanning subgraph\u201d, Journal of Algorithms\n                           32, 1999, 21\u201330.","journal-title":"Journal of Algorithms"},{"key":"20_CR3","unstructured":"J. Cheriyan, T. Jord\u00e1n, and Z. Nutov, \u201cOn rooted node-connectivity problems\u201d, to appear in Algorithmica special issue on APPROX\u201998."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd: Matrix multiplication via arithmetic progressions, J. Symbolic Comp., 9 (1990), 251\u2013280.","journal-title":"J. Symbolic Comp."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1006\/jagm.1999.1007","volume":"32","author":"Y. Dinitz","year":"1999","unstructured":"Y. Dinitz and Z. Nutov, \u201cA 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs\u201d, Journal of Algorithms\n                           32, 1999, 31\u201340.","journal-title":"Journal of Algorithms"},{"key":"20_CR6","unstructured":"A. Frank, \u201cConnectivity augmentation problems in network design\u201d, Mathematical Programming, State of the Art, J. R. Birge and K. G. Murty eds., 1994, 34\u201363."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"A. Frank and \u00c9. Tardos, An application of submodular flows, Linear Algebra and its Applications, 114\/115 (1989), 329\u2013348.","journal-title":"Linear Algebra and its Applications"},{"key":"20_CR8","unstructured":"H. N. Gabow, A representation for crossing set families with application to submodular flow problems, Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms 1993, 202\u2013211."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T. Jord\u00e1n","year":"1995","unstructured":"T. Jord\u00e1n, \u201cOn the optimal vertex-connectivity augmentation\u201d, J. Comb. Theory B\n                           63, 1995, 8\u201320.","journal-title":"J. Comb. Theory B"},{"key":"20_CR10","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 co., Boston, 1996."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. of Algorithms\n                           21, 1996, 434\u2013450.","journal-title":"J. of Algorithms"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J. B. Orlin","year":"1993","unstructured":"J. B. Orlin, \u201cA faster strongly polynomial minimum cost flow algorithm\u201d, Operations Research\n                           41, 1993, 338\u2013350.","journal-title":"Operations Research"},{"key":"20_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\n                           18, (1997), 21\u201343.","journal-title":"Algorithmica"},{"key":"20_CR14","unstructured":"R. Ravi and D. P. Williamson, private communication."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W. Mader","year":"1972","unstructured":"W. Mader, \u201cEcken vom Grad n in minimalen n-fach zusammenh\u00e4ngenden Graphen\u201d, Archive der Mathematik\n                           23, 1972, 219\u2013224.","journal-title":"Archive der Mathematik"},{"key":"20_CR16","unstructured":"W. Mader, \u201cDegree and local connectivity in finite graphs\u201d, Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague (1975), 341\u2013344."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T09:52:40Z","timestamp":1548323560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}