{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:38:42Z","timestamp":1649025522586},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:00:00Z","timestamp":1619740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:00:00Z","timestamp":1619740800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00453-021-00829-4","type":"journal-article","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:28Z","timestamp":1619795068000},"page":"2333-2350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The (2,\u00a0k)-Connectivity Augmentation Problem: Algorithmic Aspects"],"prefix":"10.1007","volume":"83","author":[{"given":"Florian","family":"H\u00f6rsch","sequence":"first","affiliation":[]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,30]]},"reference":[{"issue":"2","key":"829_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/S0036142993226983","volume":"8","author":"J Bang-Jensen","year":"1995","unstructured":"Bang-Jensen, J., Frank, A., Jackson, B.: Preserving and increasing local edge-connectivity in mixed graphs. SIAM J. Discrete Math. 8(2), 155\u2013178 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"829_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/S0895480197324700","volume":"12","author":"J Bang-Jensen","year":"1999","unstructured":"Bang-Jensen, J., Gabow, H., Jord\u00e1n, T., Szigeti, Z.: Edge-connectivity augmentation with partition constraints. SIAM J. Discrete Math. 12(2), 160\u2013207 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"829_CR3","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)","journal-title":"Math. Program."},{"issue":"4","key":"829_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/S0895480197318878","volume":"11","author":"J Bang-Jensen","year":"1998","unstructured":"Bang-Jensen, J., Jord\u00e1n, T.: Edge-connectivity augmentation preserving simplicity. SIAM J. Discrete Math. 11(4), 603\u2013623 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"829_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A., Frank, A.: Covering symmetric supermodular functions by graphs. Math. Program. 84(3), 483\u2013503 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"829_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/jgt.21643","volume":"72","author":"A Bern\u00e1th","year":"2013","unstructured":"Bern\u00e1th, A., Grappe, R., Szigeti, Z.: Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. J. Gr. Theory 72(3), 291\u2013312 (2013)","journal-title":"J. Gr. Theory"},{"issue":"1","key":"829_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1137\/140996902","volume":"31","author":"A Bern\u00e1th","year":"2017","unstructured":"Bern\u00e1th, A., Grappe, R., Szigeti, Z.: Partition constrained covering of a symmetric crossing supermodular function by a graph. SIAM J. Discrete Math. 31(1), 335\u2013382 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"829_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/net.3230190112","volume":"19","author":"GR Cai","year":"1989","unstructured":"Cai, G.R., Sun, Y.G.: The minimum augmentation of any graph to $$k$$-edge-connected graphs. Networks 19, 151\u2013172 (1989)","journal-title":"Networks"},{"issue":"4","key":"829_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/jgt.22433","volume":"91","author":"O Durand de Gevigney","year":"2019","unstructured":"Durand de Gevigney, O., Szigeti, Z.: On $$(2, k)$$-connected graphs. J. Gr. Theory 91(4), 305\u2013325 (2019)","journal-title":"J. Gr. Theory"},{"issue":"4","key":"829_CR10","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"829_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0405003","volume":"5","author":"A Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 22\u201353 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"829_CR12","volume-title":"Connections in Combinatorial Optimization","author":"A Frank","year":"2011","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford University Press, Oxford (2011)"},{"issue":"1","key":"829_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A Frank","year":"1995","unstructured":"Frank, A., Jord\u00e1n, T.: Minimal edge-coverings of pairs of sets. J. Comb. Theory Ser. B 65(1), 73\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"829_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory Ser. B 94(1), 31\u201377 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"829_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jctb.2000.1979","volume":"80","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A., Ota, K.: On minimally $$(n, \\lambda )$$-connected graphs. J. Comb. Theory Ser. B 80(1), 156\u2013171 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"829_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0166-218X(01)00349-3","volume":"123","author":"H Nagamochi","year":"2002","unstructured":"Nagamochi, H., Ibaraki, T.: Graph connectivity and its augmentation: applications of MA ordering. Discrete Appl. Math. 123, 447\u2013472 (2002)","journal-title":"Discrete Appl. Math."},{"key":"829_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-76796-1_22","volume-title":"Research Trends in Combinatorial Optimization","author":"Z Szigeti","year":"2009","unstructured":"Szigeti, Z.: On edge-connectivity augmentation of graphs and hypergraphs. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 483\u2013521. Springer, Berlin (2009)"},{"key":"829_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. Comput. Syst. Sci. 35, 96\u2013144 (1987)","journal-title":"Comput. Syst. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00829-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00829-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00829-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T14:03:33Z","timestamp":1626962613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00829-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,30]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["829"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00829-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,30]]},"assertion":[{"value":"20 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}