{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:40:06Z","timestamp":1736520006713,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_39","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"443-452","source":"Crossref","is-referenced-by-count":0,"title":["Tight Approximation Algorithm for Connectivity Augmentation Problems"],"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","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A. Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A., Frank, A.: Covering symmetric supermodular functions by graphs. Math Programming\u00a084, 483\u2013503 (1999)","journal-title":"Math Programming"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. Journal of Algorithms\u00a033, 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"key":"39_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. Journal of Algorithms\u00a033, 15\u201350 (1999)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1137\/S0097539701392287","volume":"32","author":"J. Cheriyan","year":"2003","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: An approximation algorithm for the minimum-cost k-vertex connected subgraph. SIAM Journal on Computing\u00a032(4), 1050\u20131055 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR5","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: Network design via iterative rounding of setpair relaxations. manuscript (2003)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vetta, A.: Approximation algorithms for network design with metric costs. In: Symposium on the Theory of Computing (STOC), pp. 167\u2013175 (2005)","DOI":"10.1145\/1060590.1060616"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Khanna, S.: Design networks with bounded pairwise distance. In: Symposium on the Theory of Computing (STOC), pp. 750\u2013759 (1999)","DOI":"10.1145\/301250.301447"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, J., Ruhl, M.: The directed steiner network problem is tractable for a constant number of terminals. In: Symposium on the Foundations of Computer Science (FOCS), p. 299 (1999)","DOI":"10.1109\/SFFCS.1999.814601"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Fleischer, L.K., Jain, K., Williamson, D.P.: An iterative rounding 2-approximation algorithm for the element connectivity problem. In: Symposium on the Foundations of Computer Science (FOCS), pp. 339\u2013347 (2001)","DOI":"10.1109\/SFCS.2001.959908"},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Math\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM Journal on Discrete Math"},{"key":"39_CR11","unstructured":"Frank, A.: Connectivity augmentation problems in network design. Mathematical Programming: State of the Art, 34\u201363 (1995)"},{"key":"39_CR12","unstructured":"Frank, A.: Edge-connection of graphs, digraphs, and hypergraphs, EGRES TR No 2001-11 (2001)"},{"key":"39_CR13","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. on Comb. Theory B\u00a065, 73\u2013110 (1995)","journal-title":"J. on Comb. Theory B"},{"key":"39_CR14","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, E.: An application of submodular flows. Linear Algebra and its Applications\u00a0114\/115, 329\u2013348 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"39_CR15","unstructured":"Gabow, H.N., Goemans, M.X., Tardos, E., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. In: Symposium on Discrete Algorithams (SODA), pp. 562\u2013571 (2005)"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Symposium on the Theory of Computing STOC, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"key":"39_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-40996-3_27","volume-title":"Algorithms and Computation","author":"B. Jackson","year":"2000","unstructured":"Jackson, B., Jord\u00e1n, T.: A near optimal algorithm for vertex connectivity augmentation. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 313\u2013325. Springer, Heidelberg (2000)"},{"key":"39_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45535-3_21","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Jackson","year":"2001","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 264\u2013279. Springer, Heidelberg (2001)"},{"issue":"1","key":"39_CR19","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"},{"issue":"3","key":"39_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Joural of Computing and System Sciences\u00a09(3), 256\u2013278 (1974)","journal-title":"Joural of Computing and System Sciences"},{"key":"39_CR21","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. on Comb. Theory B\u00a063, 8\u201320 (1995)","journal-title":"J. on Comb. Theory B"},{"issue":"2","key":"39_CR22","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. on Comb. Theory B\u00a071(2), 294\u2013301 (1997)","journal-title":"J. on Comb. Theory B"},{"key":"39_CR23","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":"39_CR24","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms\u00a021, 434\u2013450 (1996)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"39_CR25","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the Association for Computing Machinery\u00a041(2), 214\u2013235 (1994)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"39_CR26","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. In: Symposium on the Theory of Computing (STOC), pp. 138\u2013145 (2004)","DOI":"10.1145\/1007352.1007381"},{"key":"39_CR27","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Approximation Algorithms and Metaheuristics ( to appear, 2005)"},{"key":"39_CR28","unstructured":"Liberman, G., Nutov, Z.: On shredders and vertex-connectivity augmentation. Manuscript (2005)"},{"key":"39_CR29","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. Annals of discrete Math\u00a03, 145\u2013164 (1978)","journal-title":"Annals of discrete Math"},{"issue":"2-3","key":"39_CR30","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/S0166-218X(02)00580-2","volume":"129","author":"H. Nagamochi","year":"2003","unstructured":"Nagamochi, H., Ishii, T.: On the minimum local-vertex-connectivity augmentation in graphs. Discrete Applied Mathematics\u00a0129(2-3), 475\u2013486 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR31","unstructured":"Nutov, Z.: Approximating connectivity augmentation problems. In: Symposium on Discrete Algorithms (SODA), pp. 176\u2013185 (2005)"},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Nutov, Z.: Approximating rooted connectivity augmentation problems. Algorithmica (to appear, 2005)","DOI":"10.1007\/s00453-005-1150-5"},{"key":"39_CR33","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In: Symposium on the Theory of Computing (STOC), pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"39_CR34","unstructured":"Szigeti, Z.: On edge-connectivity augmentation of graphs and hypergraphs. manuscript (2004)"},{"issue":"1","key":"39_CR35","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. Computer and System Sciences\u00a035(1), 96\u2013144 (1987)","journal-title":"Computer and System Sciences"},{"key":"39_CR36","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02, 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:25Z","timestamp":1736439325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/11786986_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}