{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:16:17Z","timestamp":1755998177878,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030927011"},{"type":"electronic","value":"9783030927028"}],"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-92702-8_1","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:00:24Z","timestamp":1641016824000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6395-3322","authenticated-orcid":false,"given":"Waldo","family":"G\u00e1lvez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Sanhueza-Matamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Algorithms 15(2), 19:1\u201319:26 (2019). https:\/\/doi.org\/10.1145\/3182395","DOI":"10.1145\/3182395"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jagm.1999.1006","volume":"32","author":"V Auletta","year":"1999","unstructured":"Auletta, V., Dinitz, Y., Nutov, Z., Parente, D.: A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. J. Algorithms 32(1), 21\u201330 (1999). https:\/\/doi.org\/10.1006\/jagm.1999.1006","journal-title":"J. Algorithms"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Basavaraju, M., Fomin, F.V., Golovach, P.A., Misra, P., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms to preserve connectivity. In: Automata, Languages, and Programming - 41st International Colloquium, (ICALP). vol. 8572, pp. 800\u2013811. Springer (2014). DOI: https:\/\/doi.org\/10.1007\/978-3-662-43948-7_66","DOI":"10.1007\/978-3-662-43948-7_66"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Byrka, J., Grandoni, F., Ameli, A.J.: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to steiner tree. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC). pp. 815\u2013825. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384301","DOI":"10.1145\/3357713.3384301"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Cecchetto, F., Traub, V., Zenklusen, R.: Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In: 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC). pp. 370\u2013383. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451086","DOI":"10.1145\/3406325.3451086"},{"issue":"2","key":"1_CR6","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"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Cheriyan, J., Jord\u00e1n, T., Ravi, R.: On 2-coverings and 2-packings of laminar families. In: Algorithms - 7th Annual European Symposium (ESA). vol. 1643, pp. 510\u2013520. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48481-7_44","DOI":"10.1007\/3-540-48481-7_44"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2008.01.009","volume":"36","author":"J Cheriyan","year":"2008","unstructured":"Cheriyan, J., Karloff, H.J., Khandekar, R., K\u00f6nemann, J.: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4), 399\u2013401 (2008). https:\/\/doi.org\/10.1016\/j.orl.2008.01.009","journal-title":"Oper. Res. Lett."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2013.04.004","volume":"489\u2013490","author":"N Cohen","year":"2013","unstructured":"Cohen, N., Nutov, Z.: A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. 489\u2013490, 67\u201374 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.04.004","journal-title":"Theor. Comput. Sci."},{"key":"1_CR10","unstructured":"Dinitz, E., Karnazov, A., Lomonosov, M.: On the structure of the system of minimum edge cuts of a graph. Studies in Discrete Optimization pp. 290\u2013306 (1976)"},{"key":"1_CR11","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"},{"key":"1_CR12","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 Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 817\u2013831. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.53","DOI":"10.1137\/1.9781611975031.53"},{"issue":"2","key":"1_CR13","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."},{"issue":"6","key":"1_CR14","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1007\/s00224-020-10025-6","volume":"65","author":"W G\u00e1lvez","year":"2021","unstructured":"G\u00e1lvez, W., Grandoni, F., Jabal Ameli, A., Sornat, K.: On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory of Computing Systems 65(6), 985\u20131008 (2021). https:\/\/doi.org\/10.1007\/s00224-020-10025-6","journal-title":"Theory of Computing Systems"},{"key":"1_CR15","unstructured":"Goemans, M.X., Goldberg, A.V., Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9., Williamson, D.P.: Improved approximation algorithms for network design problems. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 223\u2013232. ACM\/SIAM (1994), http:\/\/dl.acm.org\/citation.cfm?id=314464.314497"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Grandoni, F., Kalaitzis, C., Zenklusen, R.: Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC). pp. 632\u2013645. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188898","DOI":"10.1145\/3188745.3188898"},{"issue":"2","key":"1_CR17","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":"1_CR18","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":"3","key":"1_CR19","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). https:\/\/doi.org\/10.1137\/S0097539702416736","journal-title":"SIAM J. Comput."},{"key":"1_CR20","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":"1_CR21","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":"1_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W Mader","year":"1972","unstructured":"Mader, W.: Ecken vom gradn in minimalenn-fach zusammenh\u00e4ngenden graphen. Archiv der Mathematik 23(1), 219\u2013224 (1972)","journal-title":"Archiv der Mathematik"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Marx, D., V\u00e9gh, L.A.: Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. ACM Trans. Algorithms 11(4), 27:1\u201327:24 (2015). https:\/\/doi.org\/10.1145\/2700210","DOI":"10.1145\/2700210"},{"issue":"1","key":"1_CR24","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":"1_CR25","unstructured":"Nutov, Z.: 2-node-connectivity network design. CoRR abs\/2002.04048 (2020), https:\/\/arxiv.org\/abs\/2002.04048"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Nutov, Z.: A $$4 + \\varepsilon $$ approximation for $$k$$-connected subgraphs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 1000\u20131009. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.60","DOI":"10.1137\/1.9781611975994.60"},{"issue":"2","key":"1_CR27","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"},{"issue":"2","key":"1_CR28","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"JP Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. Algorithms 16(2), 264\u2013282 (1994). https:\/\/doi.org\/10.1006\/jagm.1994.1012","journal-title":"J. Algorithms"},{"key":"1_CR29","unstructured":"Traub, V., Zenklusen, R.: A better-than-2 approximation for weighted tree augmentation. CoRR abs\/2104.07114 (2021), https:\/\/arxiv.org\/abs\/2104.07114"},{"issue":"2","key":"1_CR30","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/100787507","volume":"25","author":"LA V\u00e9gh","year":"2011","unstructured":"V\u00e9gh, L.A.: Augmenting undirected node-connectivity by one. SIAM J. Discret. Math. 25(2), 695\u2013718 (2011). https:\/\/doi.org\/10.1137\/100787507","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92702-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:22:08Z","timestamp":1641018128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92702-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030927011","9783030927028"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92702-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/WAOA2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"31","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":"16","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":"52% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}