{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:42Z","timestamp":1725574122929},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_13","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"141-152","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Rooted Connectivity Augmentation Problems"],"prefix":"10.1007","author":[{"given":"Zeev","family":"Nutov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/0403027","volume":"3","author":"D. Bienstock","year":"1990","unstructured":"Bienstock, D., Brickell, E.F., Monma, C.L.: On the structure of minimum weight k-connected spanning networks. SIAM J. Discrete Math.\u00a03, 320\u2013329 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00453-001-0017-7","volume":"30","author":"J. Cheriyan","year":"2001","unstructured":"Cheriyan, J., Jord\u00e1n, T., Nutov, Z.: On rooted node connectivity problems. Algorithmica\u00a030, 353\u2013375 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jagm.1999.1040","volume":"33","author":"J. Cheriyan","year":"1999","unstructured":"Cheriyan, J., Thurimella, R.: Fast algorithms for k-shredders and k-node connectivity augmentation. J. Algorithms\u00a033(1), 15\u201350 (1999)","journal-title":"J. Algorithms"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A. Frank","year":"1995","unstructured":"Frank, A., Jord\u00e1n, T.: Minimal edge-coverings of pairs of sets. J. Comb. Theory B\u00a065, 73\u2013110 (1995)","journal-title":"J. Comb. Theory B"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"Frank, A., Tardos, \u00c9.: An application of submodular flows. Linear Algebra and its Applications\u00a0114\/115, 329\u2013348 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"13_CR7","unstructured":"Jackson, B., Jord\u00e1n, T.: A near optimal algorithm for vertex connectivity augmentation (manuscript)"},{"key":"13_CR8","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation (manuscript)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T. Jord\u00e1n","year":"1995","unstructured":"Jord\u00e1n, T.: On the optimal vertex-connectivity augmentation. J. Comb. Theory B\u00a063, 8\u201320 (1995)","journal-title":"J. Comb. Theory B"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1006\/jctb.1997.1786","volume":"71","author":"T. Jord\u00e1n","year":"1997","unstructured":"Jord\u00e1n, T.: A note on the vertex connectivity augmentation. J. Comb. Theory B\u00a071(2), 294\u2013301 (1997)","journal-title":"J. Comb. Theory B"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math.\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Math."}],"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-540-45198-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:14:36Z","timestamp":1553354076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}