{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:26:26Z","timestamp":1725557186528},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_8","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:36:09Z","timestamp":1275986169000},"page":"96-109","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities"],"prefix":"10.1007","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun Kong","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"8_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. Disc. Math.\u00a08(2), 155\u2013178 (1995)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"8_CR2","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 Journal on Discrete Mathematics\u00a011(4), 603\u2013623 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-68891-4_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Bern\u00e1th","year":"2008","unstructured":"Bern\u00e1th, A., Kir\u00e1ly, T.: A new approach to splitting-off. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 401\u2013415. Springer, Heidelberg (2008)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jagm.2000.1093","volume":"37","author":"A.A. Bencz\u00far","year":"2000","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Augmenting undirected edge connectivity in O(n 2) time. Journal of Algorithms\u00a037(1), 2\u201336 (2000)","journal-title":"Journal of Algorithms"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Hariharan, R., Kavitha, T., Panigrahi, D.: An $\\tilde{O}(mn)$ Gomory-Hu tree construction algorithm for unweighted graphs. In: STOC 2007, pp. 605\u2013614 (2007)","DOI":"10.1145\/1250790.1250879"},{"key":"8_CR6","unstructured":"Bhalgat, A., Hariharan, R., Kavitha, T., Panigrahi, D.: Fast edge splitting and Edmonds\u2019 arborescence construction for unweighted graphs. In: SODA \u201908, pp. 455\u2013464 (2008)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chan, Y.H., Fung, W.S., Lau, L.C., Yung, C.K.: Degree Bounded Network Design with Metric Costs. In: FOCS \u201908, pp. 125\u2013134 (2008)","DOI":"10.1109\/FOCS.2008.28"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s101070050041","volume":"84","author":"E. Cheng","year":"1999","unstructured":"Cheng, E., Jord\u00e1n, T.: Successive edge-connectivity augmentation problems. Mathematical Programming\u00a084(3), 577\u2013593 (1999)","journal-title":"Mathematical Programming"},{"issue":"1","key":"8_CR9","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 Journal on Discrete Mathematics\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(92)90589-8","volume":"101","author":"A. Frank","year":"1992","unstructured":"Frank, A.: On a theorem of Mader. Ann. of Disc. Math.\u00a0101, 49\u201357 (1992)","journal-title":"Ann. of Disc. Math."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s004930200003","volume":"22","author":"A. Frank","year":"2002","unstructured":"Frank, A., Kir\u00e1ly, Z.: Graph orientations with edge-connection and parity constraints. Combinatorica\u00a022(1), 47\u201370 (2002)","journal-title":"Combinatorica"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Efficient splitting off algorithms for graphs. In: STOC \u201994, pp. 696\u2013705 (1994)","DOI":"10.1145\/195058.195436"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M.X. Goemans","year":"1993","unstructured":"Goemans, M.X., Bertsimas, D.J.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Prog.\u00a060(1), 145\u2013166 (1993)","journal-title":"Math. Prog."},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"8_CR15","unstructured":"Hariharan, R., Kavitha, T., Panigrahi, D.: Efficient algorithms for computing all low st edge connectivities and related problems. In: SODA \u201907, pp. 127\u2013136 (2007)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0166-218X(02)00465-1","volume":"131","author":"T. Jord\u00e1n","year":"2003","unstructured":"Jord\u00e1n, T.: On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discrete Applied Mathematics\u00a0131(2), 421\u2013432 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00493-007-0044-3","volume":"27","author":"L.C. Lau","year":"2007","unstructured":"Lau, L.C.: An approximate max-Steiner-tree-packing min-Steiner-cut theorem. Combinatorica\u00a027(1), 71\u201390 (2007)","journal-title":"Combinatorica"},{"key":"#cr-split#-8_CR18.1","unstructured":"Lov\u00e1sz, L.: Lecture. Conference of Graph Theory, Prague (1974);"},{"key":"#cr-split#-8_CR18.2","unstructured":"See also Combinatorial problems and exercises. North-Holland (1979)"},{"key":"8_CR19","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. Annals of Discrete Mathematics\u00a03, 145\u2013164 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: A fast edge-splitting algorithm in edge-weighted graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 1263\u20131268 (2006)","DOI":"10.1093\/ietfec\/e89-a.5.1263"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica\u00a07(1), 583\u2013596 (1992)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1009739202898","volume":"1","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Ibaraki, T.: Deterministic O(nm) time edge-splitting in undirected graphs. Journal of Combinatorial Optimization\u00a01(1), 5\u201346 (1997)","journal-title":"Journal of Combinatorial Optimization"},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C.S.J.A. Nash-Williams","year":"1960","unstructured":"Nash-Williams, C.S.J.A.: On orientations, connectivity and odd vertex pairings in finite graphs. Canadian Journal of Mathematics\u00a012, 555\u2013567 (1960)","journal-title":"Canadian Journal of Mathematics"},{"issue":"7","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.dam.2007.05.046","volume":"156","author":"Z. Szigeti","year":"2008","unstructured":"Szigeti, Z.: Edge-splittings preserving local edge-connectivity of graphs. Discrete Applied Mathematics\u00a0156(7), 1011\u20131018 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR25","unstructured":"Yung, C.K.: Edge splitting-off and network design problems. Master thesis, The Chinese University of Hong Kong (2009)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:00:27Z","timestamp":1606168827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}