{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:47:19Z","timestamp":1760014039822,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_2","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"13-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Flexible Graph Connectivity"],"prefix":"10.1007","author":[{"given":"David","family":"Adjiashvili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Hommelsheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"M\u00fchlenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"issue":"2","key":"2_CR1","first-page":"19","volume":"15","author":"D Adjiashvili","year":"2018","unstructured":"Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Alg. (TALG) 15(2), 19 (2018)","journal-title":"ACM Trans. Alg. (TALG)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-662-43948-7_6","volume-title":"Automata, Languages, and Programming","author":"D Adjiashvili","year":"2014","unstructured":"Adjiashvili, D., Bosio, S., Weismantel, R., Zenklusen, R.: Time-expanded packings. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 64\u201376. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43948-7_6"},{"key":"2_CR3","unstructured":"Adjiashvili, D., Hommelsheim, F., M\u00fchlenthaler, M.: Flexible graph connectivity (2019). \nhttps:\/\/arxiv.org\/abs\/1910.13297"},{"issue":"1\u20132","key":"2_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-014-0760-6","volume":"149","author":"D Adjiashvili","year":"2015","unstructured":"Adjiashvili, D., Stiller, S., Zenklusen, R.: Bulk-robust combinatorial optimization. Math. Program. 149(1\u20132), 361\u2013390 (2015). \nhttps:\/\/doi.org\/10.1007\/s10107-014-0760-6","journal-title":"Math. Program."},{"key":"2_CR5","unstructured":"Byrka, J., Grandoni, F., Ameli, A.J.: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree (2019). \nhttps:\/\/arxiv.org\/abs\/1911.02259"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Cheriyan, J., Dippel, J., Grandoni, F., Khan, A., Narayan, V.: The matching augmentation problem: a $$\\frac{7}{4}$$-approximation algorithm. Math. Program. (2019). \nhttps:\/\/doi.org\/10.1007\/s10107-019-01394-z","DOI":"10.1007\/s10107-019-01394-z"},{"key":"2_CR7","unstructured":"Dinits, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, pp. 290\u2013306 (1976)"},{"key":"2_CR8","doi-asserted-by":"crossref","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 2018, pp. 817\u2013831. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.53"},{"issue":"2","key":"2_CR9","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). \nhttps:\/\/doi.org\/10.1137\/0210019","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR10","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)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR11","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 $$k$$-edge connected spanning subgraph by LP-rounding. Networks 53(4), 345\u2013357 (2009). \nhttps:\/\/doi.org\/10.1002\/net.20289","journal-title":"Networks"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-030-39479-0_10","volume-title":"Approximation and Online Algorithms","author":"W G\u00e1lvez","year":"2020","unstructured":"G\u00e1lvez, W., Grandoni, F., Ameli, A.J., Sornat, K.: On the cycle augmentation problem: hardness and approximation algorithms. In: Bampis, E., Megow, N. (eds.) WAOA 2019. LNCS, vol. 11926, pp. 138\u2013153. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-39479-0_10"},{"key":"2_CR13","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, pp. 223\u2013232 (1994)"},{"key":"2_CR14","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 2018, pp. 632\u2013645. ACM, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3188745.3188898","DOI":"10.1145\/3188745.3188898"},{"issue":"1","key":"2_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 21(1), 39\u201360 (2001). \nhttps:\/\/doi.org\/10.1007\/s004930170004","journal-title":"Combinatorica"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003). \nhttps:\/\/doi.org\/10.1145\/950620.950621","journal-title":"J. ACM"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2786981","volume":"12","author":"G Kortsarz","year":"2016","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). \nhttps:\/\/doi.org\/10.1145\/2786981","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR18","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. Discrete Appl. Math. 239, 94\u2013105 (2018). \nhttps:\/\/doi.org\/10.1016\/j.dam.2017.12.033","journal-title":"Discrete Appl. Math."},{"key":"2_CR19","unstructured":"Nutov, Z.: On the tree augmentation problem. In: 25th Annual European Symposium on Algorithms (ESA 2017), vol. 87, p. 61. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"5","key":"2_CR20","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). \nhttps:\/\/doi.org\/10.1007\/s00493-014-2960-3","journal-title":"Combinatorica"},{"key":"2_CR21","unstructured":"The Optimization Firm: Baron (2019). \nhttps:\/\/minlp.com\/baron"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:09:07Z","timestamp":1589929747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_2"}},"subtitle":["Approximating Network Design Problems Between 1- and 2-Connectivity"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","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":"126","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":"33","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":"26% - 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":"26","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}