{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:30Z","timestamp":1761621210713,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T00:00:00Z","timestamp":1428883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["\u201cPARAMTIGHT: Parameterized complexity and the search for tight complexity results,\u201d reference 280152"],"award-info":[{"award-number":["\u201cPARAMTIGHT: Parameterized complexity and the search for tight complexity results,\u201d reference 280152"]}]},{"DOI":"10.13039\/501100003549","name":"OTKA","doi-asserted-by":"crossref","award":["NK105645"],"award-info":[{"award-number":["NK105645"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2015,6,23]]},"abstract":"<jats:p>\n            We consider connectivity-augmentation problems in a setting where each potential new edge has a non-negative cost associated with it, and the task is to achieve a certain connectivity target with at most\n            <jats:italic>p<\/jats:italic>\n            new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from\n            <jats:italic>k<\/jats:italic>\n            \u2212 1 to\n            <jats:italic>k<\/jats:italic>\n            with at most\n            <jats:italic>p<\/jats:italic>\n            new edges is fixed-parameter tractable parameterized by\n            <jats:italic>p<\/jats:italic>\n            and admits a polynomial kernel. We also prove the fixed-parameter tractability of increasing edge connectivity from 0 to 2 and increasing node connectivity from 1 to 2.\n          <\/jats:p>","DOI":"10.1145\/2700210","type":"journal-article","created":{"date-parts":[[2015,4,14]],"date-time":"2015-04-14T12:32:19Z","timestamp":1429014739000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation"],"prefix":"10.1145","volume":"11","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[{"name":"Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[{"name":"London School of Economics, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,4,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Basavaraju F. V. Fomin P. Golovach P. Misra M. S. Ramanujan and S. Saurabh. 2014. Parameterized algorithms to preserve connectivity. In Automata Languages and Programming. Springer 800--811.  M. Basavaraju F. V. Fomin P. Golovach P. Misra M. S. Ramanujan and S. Saurabh. 2014. Parameterized algorithms to preserve connectivity. In Automata Languages and Programming. Springer 800--811.","DOI":"10.1007\/978-3-662-43948-7_66"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/120902847"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701392287"},{"key":"e_1_2_1_5_1","unstructured":"E. A. Dinits A. V. Karzanov and M. V. Lomonosov. 1976. On the structure of a family of minimal weighted cuts in graphs. In Studies in Discrete Mathematics A. A. Fridman (Ed.). Nauka Moscow 290--306. In Russian.  E. A. Dinits A. V. Karzanov and M. V. Lomonosov. 1976. On the structure of a family of minimal weighted cuts in graphs. In Studies in Discrete Mathematics A. A. Fridman (Ed.). Nauka Moscow 290--306. In Russian."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Springer New York.   R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Springer New York.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_2_1_7_1","unstructured":"J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer Berlin.   J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer Berlin."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405003"},{"volume-title":"Connections in Combinatorial Optimization. Number 38 in Oxford lecture series in mathematics and its applications","author":"Frank A.","key":"e_1_2_1_9_1","unstructured":"A. Frank . 2011. Connections in Combinatorial Optimization. Number 38 in Oxford lecture series in mathematics and its applications . Oxford University Press . A. Frank. 2011. Connections in Combinatorial Optimization. Number 38 in Oxford lecture series in mathematics and its applications. Oxford University Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1044"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579200"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v56:2"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1077"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.01.004"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1002"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702974"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"G. Kortsarz and Z. Nutov. 2007. Approximating minimum cost connectivity problems. In Handbook on Approximation Algorithms and Metaheuristics T.F. Gonzalez (Ed.). Chapman &amp; Hall\/CRC London.  G. Kortsarz and Z. Nutov. 2007. Approximating minimum cost connectivity problems. In Handbook on Approximation Algorithms and Metaheuristics T.F. Gonzalez (Ed.). Chapman &amp; Hall\/CRC London.","DOI":"10.1201\/9781420010749.ch58"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Daniel Lokshtanov Neeldhara Misra and Saket Saurabh. 2012. Kernelization - preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond. 129--161.  Daniel Lokshtanov Neeldhara Misra and Saket Saurabh. 2012. Kernelization - preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond. 129--161.","DOI":"10.1007\/978-3-642-30891-8_10"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.10.001"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00218-4"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00224-7"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/100787507"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90038-9"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2700210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2700210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:43Z","timestamp":1750223263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2700210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,13]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6,23]]}},"alternative-id":["10.1145\/2700210"],"URL":"https:\/\/doi.org\/10.1145\/2700210","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2015,4,13]]},"assertion":[{"value":"2013-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}