{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:55:13Z","timestamp":1725738913639},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_61","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"721-732","source":"Crossref","is-referenced-by-count":3,"title":["Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"61_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM Journal on Computing\u00a024(3), 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"61_CR2","first-page":"1212","volume":"arXiv","author":"J. Cheriyan","year":"2012","unstructured":"Cheriyan, J., V\u00e9gh, L.A.: Approximating minimum-cost k-node connected subgraphs via independence-free graphs. arXiv preprint arXiv:1212.3981 (2012)","journal-title":"arXiv preprint"},{"issue":"4","key":"61_CR3","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 J. Comput.\u00a032(4), 1050\u20131055 (2003)","journal-title":"SIAM J. Comput."},{"key":"61_CR4","unstructured":"Dinits, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in graphs. In: Fridman, A. (ed.) Studies in Discrete Mathematics, Nauka, Moscow, pp. 290\u2013306 (1976) (in Russian)"},{"key":"61_CR5","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"61_CR6","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"issue":"1","key":"61_CR7","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 J. Discret. Math.\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"61_CR8","unstructured":"Frank, A.: Connections in combinatorial optimization. Oxford lecture series in mathematics and its applications, vol.\u00a038. Oxford Univ. Pr. (2011)"},{"issue":"1","key":"61_CR9","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. Journal of Combinatorial Theory, Series B\u00a065(1), 73\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"61_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"issue":"2","key":"61_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"61_CR12","first-page":"131","volume":"56","author":"J. Guo","year":"2010","unstructured":"Guo, J., Uhlmann, J.: Kernelization and complexity results for connectivity augmentation problems. Networks\u00a056(2), 131\u2013142 (2010)","journal-title":"Networks"},{"issue":"2","key":"61_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/jagm.2000.1077","volume":"35","author":"T. Hsu","year":"2000","unstructured":"Hsu, T.: On four-connecting a triconnected graph. Journal of Algorithms\u00a035(2), 202\u2013234 (2000)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"61_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B. Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. Journal of Combinatorial Theory, Series B\u00a094(1), 31\u201377 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"61_CR15","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":"1","key":"61_CR16","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. Journal of Combinatorial Theory, Series B\u00a063(1), 8\u201320 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"61_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00453-003-1027-4","volume":"37","author":"G. Kortsarz","year":"2003","unstructured":"Kortsarz, G., Nutov, Z.: Approximating node connectivity problems via set covers. Algorithmica\u00a037(2), 75\u201392 (2003)","journal-title":"Algorithmica"},{"key":"61_CR18","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T. (ed.) Handbook on Approximation Algorithms and Metaheuristics. Chapman & Hall\/CRC, London (2007)","DOI":"10.1201\/9781420010749.ch58"},{"key":"61_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"D. Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization \u2013 preprocessing with a guarantee. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol.\u00a07370, pp. 129\u2013161. Springer, Heidelberg (2012)"},{"issue":"1","key":"61_CR20","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.disopt.2010.10.001","volume":"8","author":"N. Misra","year":"2011","unstructured":"Misra, N., Raman, V., Saurabh, S.: Lower bounds on kernelization. Discrete Optimization\u00a08(1), 110\u2013128 (2011)","journal-title":"Discrete Optimization"},{"issue":"1","key":"61_CR21","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(1), 83\u2013113 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-3","key":"61_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","volume":"233","author":"J. Nesetril","year":"2001","unstructured":"Nesetril, J., Milkov\u00e1, E., Nesetrilov\u00e1, H.: Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics\u00a0233(1-3), 3\u201336 (2001)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"61_CR23","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/100787507","volume":"25","author":"L.A. V\u00e9gh","year":"2011","unstructured":"V\u00e9gh, L.A.: Augmenting undirected node-connectivity by one. SIAM Journal on Discrete Mathematics\u00a025(2), 695\u2013718 (2011)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"61_CR24","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. J. Comput. Syst. Sci.\u00a035(1), 96\u2013144 (1987)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:37:27Z","timestamp":1557913047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}