{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:08:59Z","timestamp":1768745339288,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00493-012-2548-8","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:52:17Z","timestamp":1346532737000},"page":"373-401","source":"Crossref","is-referenced-by-count":4,"title":["A unifying approach to splitting-off"],"prefix":"10.1007","volume":"32","author":[{"given":"Attila","family":"Bern\u00e1th","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,2]]},"reference":[{"key":"2548_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S0036142993226983","volume":"8","author":"J. Bang-Jensen","year":"1995","unstructured":"J. Bang-Jensen, A. Frank and Bill Jackson: Preserving and increasing local edge-connectivity in mixed graphs, SIAM J. Discrete Math. 8 (1995), 155\u2013178.","journal-title":"SIAM J. Discrete Math."},{"key":"2548_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A. A. Bencz\u00far","year":"1999","unstructured":"A. A. Bencz\u00far and A. Frank: Covering symmetric supermodular functions by graphs, Math. Program. 84 Ser. B, (1999), 483\u2013503, Connectivity augmentation of networks: structures and algorithms (Budapest, 1994).","journal-title":"Math. Program."},{"key":"2548_CR3","unstructured":"A. Bern\u00e1th and T. Kir\u00e1ly: A new approach to splitting-off, Tech. Report TR-2008-02, Egerv\u00e1ry Research Group, Budapest, 2008, www.cs.elte.hu\/egres ."},{"key":"2548_CR4","doi-asserted-by":"crossref","unstructured":"Y. H. Chan, W. S. Fung, L. C. Lau and C. K. Yung: Degree bounded network design with metric costs, Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science (Washington, DC, USA), IEEE Computer Society, 2008, 125\u2013134.","DOI":"10.1109\/FOCS.2008.28"},{"key":"2548_CR5","unstructured":"B. Cosh: Vertex splitting and connectivity augmentation in hypergraphs, PhDThesis, University of London, (2000)."},{"key":"2548_CR6","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.dam.2009.12.011","volume":"158","author":"B. Cosh","year":"2010","unstructured":"B. Cosh, B. Jackson, and Z. Kir\u00e1ly: Local edge-connectivity augmentation in hypergraphs is NP-complete, Discrete Applied Mathematics 158 723\u2013727, 2010.","journal-title":"Discrete Applied Mathematics"},{"key":"2548_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank: Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5 (1992), 25\u201353.","journal-title":"SIAM J. Discrete Math."},{"key":"2548_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(92)90589-8","volume":"101","author":"A. Frank","year":"1992","unstructured":"A. Frank: On a theorem of Mader, Discrete Math. 101 (1992), 49\u201357; Special volume to mark the centennial of Julius Petersen\u2019s \u201cDie Theorie der regul\u00e4ren Graphs\u201d, Part II.","journal-title":"Discrete Math."},{"key":"2548_CR9","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.dam.2007.09.012","volume":"156","author":"R. Grappe","year":"2008","unstructured":"R. Grappe and Z. Szigeti: Note: Covering symmetric semi-monotone functions, Discrete Appl. Math. 156 (2008), 138\u2013144.","journal-title":"Discrete Appl. Math."},{"key":"2548_CR10","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1016\/j.dam.2006.04.017","volume":"154","author":"T. Ishii","year":"2006","unstructured":"T. Ishii and M. Hagiwara: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs, Discrete Appl. Math. 154 (2006), 2307\u20132329.","journal-title":"Discrete Appl. Math."},{"key":"2548_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"W. Mader: A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978), 145\u2013164; Advances in graph theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977).","journal-title":"Ann. Discrete Math"},{"key":"2548_CR12","first-page":"224","volume":"47","author":"H. Miwa","year":"2004","unstructured":"H. Miwa and H. Ito: NA-edge-connectivity augmentation problems by adding edges, J. Oper. Res. Soc. Japan 47 (2004), 224\u2013243.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"2548_CR13","unstructured":"Z. Nutov: Approximating connectivity augmentation problems, SODA\u2019 05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (Philadelphia, PA, USA), Society for Industrial and Applied Mathematics, 2005, 176\u2013185."},{"key":"2548_CR14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s101070050036","volume":"84","author":"Z. Szigeti","year":"1999","unstructured":"Z. Szigeti: Hypergraph connectivity augmentation, Math. Program. Ser. B 84 (1999), 519\u2013527; Connectivity augmentation of networks: structures and algorithms (Budapest, 1994).","journal-title":"Math. Program"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2548-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2548-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2548-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T09:06:24Z","timestamp":1562144784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2548-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["2548"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2548-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}