{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:33Z","timestamp":1781305053966,"version":"3.54.1"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_4","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:52Z","timestamp":1781303692000},"page":"47-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes for\u00a0Planar Graph Connectivity Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3664-3687","authenticated-orcid":false,"given":"Meike","family":"Neuwohner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9749-2600","authenticated-orcid":false,"given":"Vera","family":"Traub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7148-9304","authenticated-orcid":false,"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Tran. Algorithms 15(2), 19:1\u201319:26 (2018). https:\/\/doi.org\/10.1145\/3182395","DOI":"10.1145\/3182395"},{"key":"4_CR2","unstructured":"Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 33\u201341 (1998)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bateni, M., Hajiaghayi, M., Marx, D.: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 21:1\u201321:37 (2011). https:\/\/doi.org\/10.1145\/2027216.2027219","DOI":"10.1145\/2027216.2027219"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Berger, A., Grigni, M.: Minimum weight 2-edge-connected spanning subgraphs in planar graphs. In: Automata, Languages and Programming (ICALP), pp. 90\u2013101 (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_10","DOI":"10.1007\/978-3-540-73420-8_10"},{"key":"4_CR6","unstructured":"Borradaile, G., Kenyon-Mathieu, C., Klein, P.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1285\u20131294 (2007)"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Borradaile, G., Klein, P., Mathieu, C.: An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5(3), 31:1\u201331:31 (2009). https:\/\/doi.org\/10.1145\/1541885.1541892","DOI":"10.1145\/1541885.1541892"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Borradaile, G., Zheng, B.: A PTAS for three-edge-connected survivable network design in planar graphs. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/ RANDOM 2017). vol. 81, pp. 3:1\u20133:13 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2017.3","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2017.3"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00453-012-9662-2","volume":"68","author":"G Borradaile","year":"2012","unstructured":"Borradaile, G., Demaine, E.D., Tazari, S.: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica 68(2), 287\u2013311 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9662-2","journal-title":"Algorithmica"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Borradaile, G., Klein, P.: The two-edge connectivity survivable-network design problem in planar graphs. ACM Trans. Algorithms 12(3), 30:1\u201330:29 (2016). https:\/\/doi.org\/10.1145\/2831235","DOI":"10.1145\/2831235"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Bosch-Calvo, M., Garg, M., Grandoni, F., Hommelsheim, F., Ameli, A.J., Lindermayr, A.: A 5\/4-approximation for two-edge connectivity. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC), pp. 653\u2013664 (2025). https:\/\/doi.org\/10.1145\/3717823.3718275","DOI":"10.1145\/3717823.3718275"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Byrka, J., Grandoni, F., Jabal Ameli, A.: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to steiner tree. In: Proceedings of 52nd ACM Symposium on Theory of Computing (STOC) (2020). https:\/\/doi.org\/10.1145\/3357713.3384301","DOI":"10.1145\/3357713.3384301"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Cecchetto, F., Traub, V., Zenklusen, R.: Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In: Proceedings of 53rd Annual ACM Symposium on Theory of Computing (STOC), pp. 370\u2013383 (2021). https:\/\/doi.org\/10.1145\/3406325.3451086","DOI":"10.1145\/3406325.3451086"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-023-02018-3","volume":"207","author":"F Cecchetto","year":"2024","unstructured":"Cecchetto, F., Traub, V., Zenklusen, R.: Better-than-$$\\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207(1), 515\u2013549 (2024). https:\/\/doi.org\/10.1007\/s10107-023-02018-3","journal-title":"Math. Program."},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Chalermsook, P., Das, S., Even, G., Laekhanukit, B., Vaz, D.: Survivable network design for group connectivity in low-treewidth graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2018). vol. 116, pp. 8:1\u20138:19 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.8","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.8"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s00453-016-0270-4","volume":"80","author":"J Cheriyan","year":"2017","unstructured":"Cheriyan, J., Gao, Z.: Approximating (unweighted) tree augmentation via lift-and-project, Part I: stemless TAP. Algorithmica 80(2), 530\u2013559 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0270-4","journal-title":"Algorithmica"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s00453-017-0275-7","volume":"80","author":"J Cheriyan","year":"2017","unstructured":"Cheriyan, J., Gao, Z.: Approximating (Unweighted) tree augmentation via lift-and-project, Part II. Algorithmica 80(2), 608\u2013651 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0275-7","journal-title":"Algorithmica"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Seb\u0151, A., Szigeti, Z.: Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph. SIAM J. Discret. Math. 14(2), 170\u2013180 (2001)","DOI":"10.1137\/S0895480199362071"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1137\/S009753979833920X","volume":"30","author":"J Cheriyan","year":"2000","unstructured":"Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via matching. SIAM J. Comput. 30(2), 528\u2013560 (2000). https:\/\/doi.org\/10.1137\/S009753979833920X","journal-title":"SIAM J. Comput."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2013.04.004","volume":"489","author":"N Cohen","year":"2013","unstructured":"Cohen, N., Nutov, Z.: A $$(1+ \\ln 2)$$-approximation algorithm for minimum-cost 2- edge-connectivity augmentation of trees with constant radius. Theoret. Comput. Sci. 489, 67\u201374 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.04.004","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., Colin de Verdi\u00e8re, \u00c9., Klein, P.N., Mathieu, C., Meierfrankenfeld, D.: Approximating connectivity domination in weighted bounded-genus graphs. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 584\u2013597 (2016). https:\/\/doi.org\/10.1145\/2897518.2897635","DOI":"10.1145\/2897518.2897635"},{"key":"4_CR22","unstructured":"Czumaj, A., Grigni, M., Sissokho, P., Zhao, H.: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 496\u2013505 (2004)"},{"key":"4_CR23","unstructured":"Czumaj, A., Lingas, A.: On approximability of the minimum-cost k-connected spanning subgraph problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 281\u2013290 (1999)"},{"key":"4_CR24","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 590\u2013601 (2005)"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Hajiaghayi, M.: Approximation schemes for planar graph problems. In: Encyclopedia of Algorithms, pp. 59\u201362. Springer, Boston, MA (2008). https:\/\/doi.org\/10.1007\/978-0-387-30162-4_32","DOI":"10.1007\/978-0-387-30162-4_32"},{"issue":"5","key":"4_CR26","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00493-010-2341-5","volume":"30","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. Combinatorica 30(5), 533\u2013552 (2010). https:\/\/doi.org\/10.1007\/s00493-010-2341-5","journal-title":"Combinatorica"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Even, G., Feldman, J., Kortsarz, G., Nutov, Z.: A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 5(2), 21:1\u201321:17 (2009). https:\/\/doi.org\/10.1145\/1497290.1497297","DOI":"10.1145\/1497290.1497297"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0931","volume":"28","author":"CG Fernandes","year":"1998","unstructured":"Fernandes, C.G.: A better approximation ratio for the minimum size$$ k$$-edge-connected spanning subgraph problem. J. Algorithms 28(1), 105\u2013124 (1998). https:\/\/doi.org\/10.1006\/jagm.1998.0931","journal-title":"J. Algorithms"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Fiorini, S., Gro\u00df, M., K\u00f6nemann, J., Sanit\u00e0, L.: Approximating weighted tree augmentation via chv\u00e1tal-gomory cuts. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 817\u2013831 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.53","DOI":"10.1137\/1.9781611975031.53"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Approximation schemes via width\/weight trade-offs on minor-free graphs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2299\u20132318 (2019). https:\/\/doi.org\/10.1137\/1.9781611975994.141","DOI":"10.1137\/1.9781611975994.141"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Fox-Epstein, E., Klein, P.N., Schild, A.: Embedding planar graphs into low-treewidth graphs with applications to efficient approximation schemes for metric problems. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1069\u20131088 (2019)","DOI":"10.1137\/1.9781611975482.66"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"GN Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1J\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270\u2013283 (1981). https:\/\/doi.org\/10.1137\/0210019","journal-title":"SIAM J. Comput."},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"GN Frederickson","year":"1982","unstructured":"Frederickson, G.N., J\u00e1j\u00e1, J.: On the relationship between the biconnectivity augmentation and traveling salesman problems. Theoret. Comput. Sci. 19, 189\u2013201 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR34","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/net.20289","volume":"53","author":"HN Gabow","year":"2009","unstructured":"Gabow, H.N., Goemans, M.X., Tardos, \u00c9., Williamson, D.P.: Approximating the smallest it k-edge connected spanning subgraph by LP-rounding. Networks 53(4), 345\u2013357 (2009). https:\/\/doi.org\/10.1002\/net.20289","journal-title":"Networks"},{"issue":"1","key":"4_CR35","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/080732572","volume":"41","author":"HN Gabow","year":"2012","unstructured":"Gabow, H.N., Gallagher, S.R.: Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. SIAM J. Comput. 41(1), 61\u2013103 (2012). https:\/\/doi.org\/10.1137\/080732572","journal-title":"SIAM J. Comput."},{"key":"4_CR36","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co. (1990)"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Garg, M., Grandoni, F., Jabal Ameli, A.: Improved approximation for two-edge-connectivity. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2368\u20132410 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch92","DOI":"10.1137\/1.9781611977554.ch92"},{"issue":"2","key":"4_CR38","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Grandoni, F., Kalaitzis, C., Zenklusen, R.: Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of 50th ACM Symposium on Theory of Computing (STOC), pp. 632\u2013645 (2018). https:\/\/doi.org\/10.1145\/3188745.3188898","DOI":"10.1145\/3188745.3188898"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Grigni, M., Koutsoupias, E., Papadimitriou, C.: An approximation scheme for planar graph TSP. In: Proceedings of IEEE 36th Annual Foundations of Computer Science (FOCS), pp. 640\u2013645 (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492665","DOI":"10.1109\/SFCS.1995.492665"},{"key":"4_CR41","doi-asserted-by":"publisher","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Subgraph induced planar connectivity augmentation. In: Graph-Theoretic Concepts in Computer Science (WG), pp. 261\u2013272 (2003). https:\/\/doi.org\/10.1007\/978-3-540-39890-5_23","DOI":"10.1007\/978-3-540-39890-5_23"},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"Hershkowitz, D.E., Klein, N., Zenklusen, R.: Ghost value augmentation for k-edge-connectivity. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pp. 1853\u20131864 (2024). https:\/\/doi.org\/10.1145\/3618260.3649715","DOI":"10.1145\/3618260.3649715"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Hommelsheim, F., Lindermayr, A., Liu, Z.: A Better-Than-$$5\/4$$-approximation for two-edge connectivity. In: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1468\u20131520 (2026)","DOI":"10.1137\/1.9781611978971.54"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Hunkenschr\u00f6der, C., Vempala, S., Vetta, A.: A 4\/3-Approximation algorithm for the minimum 2-edge connected subgraph problem. ACM Trans. Algorithms 5(4), 55:1\u201355:28 (2019)","DOI":"10.1145\/3341599"},{"key":"4_CR45","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 21, 39\u201360 (2001). https:\/\/doi.org\/10.1007\/s004930170004","journal-title":"Combinatorica"},{"key":"4_CR46","doi-asserted-by":"publisher","unstructured":"Khanna, S., Motwani, R.: Towards a syntactic characterization of PTAS. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC), pp. 329\u2013337 (1996). https:\/\/doi.org\/10.1145\/237814.237979","DOI":"10.1145\/237814.237979"},{"issue":"2","key":"4_CR47","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S Khuller","year":"1993","unstructured":"Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. J. Algorithms 14(2), 214\u2013225 (1993). https:\/\/doi.org\/10.1006\/jagm.1993.1010","journal-title":"J. Algorithms"},{"issue":"2","key":"4_CR48","doi-asserted-by":"publisher","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. J. ACM 41(2), 214\u2013235 (1994). https:\/\/doi.org\/10.1145\/174652.174654","journal-title":"J. ACM"},{"issue":"10","key":"4_CR49","doi-asserted-by":"publisher","first-page":"3024","DOI":"10.1007\/s00453-023-01128-w","volume":"85","author":"PN Klein","year":"2023","unstructured":"Klein, P.N., Mathieu, C., Zhou, H.: Correlation clustering and two-edge-connected augmentation for planar graphs. Algorithmica 85(10), 3024\u20133057 (2023). https:\/\/doi.org\/10.1007\/s00453-023-01128-w","journal-title":"Algorithmica"},{"key":"4_CR50","doi-asserted-by":"publisher","unstructured":"Klein, P.: A linear-time approximation scheme for planar weighted TSP. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 647\u2013656 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.7","DOI":"10.1109\/SFCS.2005.7"},{"key":"4_CR51","doi-asserted-by":"publisher","unstructured":"Kobayashi, Y., Noguchi, T.: An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover. In: 34th International Symposium on Algorithms and Computation (ISAAC), pp. 49:1\u201349:10 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2023.49","DOI":"10.4230\/LIPIcs.ISAAC.2023.49"},{"issue":"3","key":"4_CR52","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/S0097539702416736","volume":"33","author":"G Kortsarz","year":"2004","unstructured":"Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of approximation for vertex-connectivity network design problems. SIAM J. Comput. 33(3), 704\u2013720 (2004)","journal-title":"SIAM J. Comput."},{"key":"4_CR53","doi-asserted-by":"publisher","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:1\u201323:20 (2016). https:\/\/doi.org\/10.1145\/2786981","DOI":"10.1145\/2786981"},{"key":"4_CR54","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2017.12.033","volume":"239","author":"G Kortsarz","year":"2018","unstructured":"Kortsarz, G., Nutov, Z.: LP-relaxations for tree augmentation. Discret. Appl. Math. 239, 94\u2013105 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.12.033","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"4_CR55","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. Discret. Appl. Math. 126(1), 83\u2013113 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00218-4","journal-title":"Discret. Appl. Math."},{"key":"4_CR56","doi-asserted-by":"publisher","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in an undirected network. SIAM J. Discrete Math. 10(3), 469\u2013481 (1997). https:\/\/doi.org\/10.1137\/S0895480194271323","DOI":"10.1137\/S0895480194271323"},{"issue":"2","key":"4_CR57","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00453-020-00765-9","volume":"83","author":"Z Nutov","year":"2020","unstructured":"Nutov, Z.: On the tree augmentation Problem. Algorithmica 83(2), 553\u2013575 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00765-9","journal-title":"Algorithmica"},{"key":"4_CR58","doi-asserted-by":"publisher","unstructured":"Nutov, Z.: Approximation algorithms for connectivity augmentation problems. In: Proceedings of the 16th International Computer Science Symposium in Russia (CRS), pp. 321\u2013338 (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_19","DOI":"10.1007\/978-3-030-79416-3_19"},{"key":"4_CR59","doi-asserted-by":"publisher","unstructured":"Pritchard, D.: K-edge-connectivity: approximation and LP relaxation. In: Approximation and Online Algorithms (WAOA), pp. 225\u2013236 (2011). https:\/\/doi.org\/10.1007\/978-3-642-18318-8_20","DOI":"10.1007\/978-3-642-18318-8_20"},{"issue":"2","key":"4_CR60","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jagm.1999.1005","volume":"32","author":"JS Provan","year":"1999","unstructured":"Provan, J.S., Burk, R.C.: Two-connected augmentation problems in planar graphs. J. Algorithms 32(2), 87\u2013107 (1999). https:\/\/doi.org\/10.1006\/jagm.1999.1005","journal-title":"J. Algorithms"},{"key":"4_CR61","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.endm.2008.06.009","volume":"31","author":"I Rutter","year":"2008","unstructured":"Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. Electron. Notes Discrete Math. 31, 53\u201356 (2008). https:\/\/doi.org\/10.1016\/j.endm.2008.06.009","journal-title":"Electron. Notes Discrete Math."},{"issue":"5","key":"4_CR62","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00493-014-2960-3","volume":"34","author":"A Seb\u0151","year":"2014","unstructured":"Seb\u0151, A., Vygen, J.: Shorter tours by nicer ears: 7\/5-approximation for the graph-TSP, 3\/2 for the path version, and 4\/3 for two-edge-connected subgraphs. Combinatorica 34(5), 597\u2013629 (2014). https:\/\/doi.org\/10.1007\/s00493-014-2960-3","journal-title":"Combinatorica"},{"key":"4_CR63","doi-asserted-by":"crossref","unstructured":"Traub, V., Zenklusen, R.: A $$(1.5+\\varepsilon )$$-approximation algorithm for weighted connectivity augmentation. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), pp. 1820\u20131833 (2023)","DOI":"10.1145\/3564246.3585122"},{"key":"4_CR64","doi-asserted-by":"publisher","unstructured":"Traub, V., Zenklusen, R.: Better-Than-2 approximations for weighted tree augmentation and applications to steiner tree. J. ACM 72(2), 16:1\u201316:40 (2025). https:\/\/doi.org\/10.1145\/3722101","DOI":"10.1145\/3722101"},{"key":"4_CR65","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer (2001)"},{"key":"4_CR66","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"4_CR67","doi-asserted-by":"publisher","unstructured":"Zheng, B.: Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs (2017). https:\/\/doi.org\/10.48550\/arXiv.1701.08315","DOI":"10.48550\/arXiv.1701.08315"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:57Z","timestamp":1781303697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"No Competing Interest Statement Required By Publisher"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}