{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:05Z","timestamp":1725514205913},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_28","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"401-415","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to Splitting-Off"],"prefix":"10.1007","author":[{"given":"Attila","family":"Bern\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_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.\u00a08(2), 155\u2013178 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A.A. Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A.A., Frank, A.: Covering symmetric supermodular functions by graphs. Math. Program. Ser. B\u00a084(3), 483\u2013503 (1999); Connectivity augmentation of networks: structures and algorithms (Budapest, 1994)","journal-title":"Math. Program. Ser. B"},{"unstructured":"Bern\u00e1th, A., Kir\u00e1ly, T.: A new approach to splitting-off, Tech. Report TR-2008-02, Egerv\u00e1ry Research Group, Budapest (2008), \n                    \n                      http:\/\/www.cs.elte.hu\/egres","key":"28_CR3"},{"unstructured":"Cosh, B., Jackson, B., Kir\u00e1ly, Z.: Local connectivity augmentation in hypergraphs is NP-complete (manuscript)","key":"28_CR4"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"25","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.\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.dam.2007.09.012","volume":"156","author":"R. Grappe","year":"2008","unstructured":"Grappe, R., Szigeti, Z.: Note: Covering symmetric semi-monotone functions. Discrete Appl. Math.\u00a0156(1), 138\u2013144 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"28_CR7","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.dam.2006.04.017","volume":"154","author":"T. Ishii","year":"2006","unstructured":"Ishii, T., Hagiwara, M.: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Appl. Math.\u00a0154(16), 2307\u20132329 (2006)","journal-title":"Discrete Appl. Math."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. Ann. Discrete Math.\u00a03, 145\u2013164 (1978); (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"28_CR9","first-page":"224","volume":"47","author":"H. Miwa","year":"2004","unstructured":"Miwa, H., Ito, H.: NA-edge-connectivity augmentation problems by adding edges. J. Oper. Res. Soc. Japan\u00a047(4), 224\u2013243 (2004)","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s101070050036","volume":"84","author":"Z. Szigeti","year":"1999","unstructured":"Szigeti, Z.: Hypergraph connectivity augmentation. Math. Program. Ser. B\u00a084(3), 519\u2013527 (1999); Connectivity augmentation of networks: structures and algorithms (Budapest, 1994)","journal-title":"Math. Program. Ser. B"},{"issue":"1","key":"28_CR11","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. J. Comput. System Sci.\u00a035(1), 96\u2013144 (1987)","journal-title":"J. Comput. System Sci."}],"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-540-68891-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:59Z","timestamp":1620015479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_28","relation":{},"subject":[]}}