{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:36Z","timestamp":1781345676167,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030794156","type":"print"},{"value":"9783030794163","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_19","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"321-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for Connectivity Augmentation Problems"],"prefix":"10.1007","author":[{"given":"Zeev","family":"Nutov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. In: SODA, pp. 2384\u20132399 (2017)","DOI":"10.1137\/1.9781611974782.157"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050033","volume":"84","author":"J Bang-Jensen","year":"1999","unstructured":"Bang-Jensen, J., Jackson, B.: Augmenting hypergraphs by edges of size two. Math. Program. 84(3), 467\u2013481 (1999). https:\/\/doi.org\/10.1007\/s101070050033","journal-title":"Math. Program."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Basavaraju, M., Fomin, F.V., Golovach, P.A., Misra, P., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms to preserve connectivity. In: ICALP, Part I, pp. 800\u2013811 (2014)","DOI":"10.1007\/978-3-662-43948-7_66"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"AA Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A.A., Frank, A.: Covering symmetric supermodular functions by graphs. Math. Program. 84(3), 483\u2013503 (1999). https:\/\/doi.org\/10.1007\/s101070050034","journal-title":"Math. Program."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00493-012-2548-8","volume":"32","author":"A Bern\u00e1th","year":"2012","unstructured":"Bern\u00e1th, A., Kir\u00e1ly, T.: A unifying approach to splitting-off. Combinatorica 32(4), 373\u2013401 (2012)","journal-title":"Combinatorica"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Ameli, A.J.: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to steiner tree. In: STOC, pp. 815\u2013825 (2020)","DOI":"10.1145\/3357713.3384301"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00df, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013)","DOI":"10.1145\/2432622.2432628"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cecchetto, F., Traub, V., Zenklusen, R.: Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. CoRR, abs\/2012.00086 (2020). To appear in STOC 2021","DOI":"10.1145\/3406325.3451086"},{"key":"19_CR9","unstructured":"Dinic, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in a graph. In: Studies in Discrete Optimization, pp. 290\u2013306 (1976)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Dinitz, Y., Nutov, Z.: A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In: STOC, pp. 509\u2013518 (1995)","DOI":"10.1145\/225058.225268"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Gro\u00df, M., K\u00f6nemann, J., Sanit\u00e1, L.: A $$\\frac{3}{2}$$-approximation algorithm for tree augmentation via chv\u00e1tal-gomory cuts. In: SODA, pp. 817\u2013831 (2018)","DOI":"10.1137\/1.9781611975031.53"},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.jcss.2005.05.006","volume":"72","author":"L Fleischer","year":"2006","unstructured":"Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci. 72(5), 838\u2013867 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR13","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford University Press, Oxford (2011)"},{"key":"19_CR14","unstructured":"Frank, A., Jord\u00e1n, T.: Graph connectivity augmentation. In: Thulasiraman, K., Arumugam, S., Brandstadt, A., Nishizeki, T. (eds.) Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, chap. 14, pp. 313\u2013346. CRC Press (2015)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"G\u00e1lvez, W., Grandoni, F., Ameli, A.J., Sornat, K.: On the cycle augmentation problem: hardness and approximation algorithms. In: WAOA, pp. 138\u2013153 (2019)","DOI":"10.1007\/978-3-030-39479-0_10"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Kalaitzis, C., Zenklusen, R.: Improved approximation for tree augmentation: saving by rewiring. In: STOC, pp. 632\u2013645 (2018)","DOI":"10.1145\/3188745.3188898"},{"key":"19_CR17","unstructured":"Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, chap. 6, pp. 236\u2013265. PWS (1995)"},{"issue":"6","key":"19_CR18","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.dam.2009.12.011","volume":"158","author":"Z Kir\u00e1ly","year":"2010","unstructured":"Kir\u00e1ly, Z., Cosh, B., Jackson, B.: Local edge-connectivity augmentation in hypergraphs is NP-complete. Discret. Appl. Math. 158(6), 723\u2013727 (2010)","journal-title":"Discret. Appl. Math."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: A simplified $$1.5$$-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 12(2), 23 (2016)","DOI":"10.1145\/2786981"},{"issue":"13","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1016\/j.dam.2010.04.002","volume":"158","author":"Y Maduel","year":"2010","unstructured":"Maduel, Y., Nutov, Z.: Covering a laminar family by leaf to leaf links. Discret. Appl. Math. 158(13), 1424\u20131432 (2010)","journal-title":"Discret. Appl. Math."},{"key":"19_CR21","unstructured":"Nutov, Z.: Structures of cuts and cycles in graphs; algorithms and applications. Ph.D. thesis, Technion, Israel Institute of Technology (1997)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Nutov, Z.: Approximating connectivity augmentation problems. ACM Trans. Algorithms 6(1), 5:1\u20135:19 (2009)","DOI":"10.1145\/1644015.1644020"},{"key":"19_CR23","unstructured":"Nutov, Z.: $$2$$-node-connectivity network design. CoRR, abs\/2002.04048 (2020). To appear in WAOA20"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00453-020-00765-9","volume":"83","author":"Z Nutov","year":"2021","unstructured":"Nutov, Z.: On the tree augmentation problem. Algorithmica 83(2), 553\u2013575 (2021)","journal-title":"Algorithmica"},{"key":"19_CR25","unstructured":"Nutov, Z., Kortsarz, G., Shalom, E.: Approximating activation edge-cover and facility location problems. In: MFCS, pp. 20:1\u201320:14 (2019)"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02523686","volume":"18","author":"R Ravi","year":"1997","unstructured":"Ravi, R., Williamson, D.P.: An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica 18(1), 21\u201343 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:23:19Z","timestamp":1623972199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}