{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:29Z","timestamp":1725559169057},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_27","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T12:40:39Z","timestamp":1279111239000},"page":"362-376","source":"Crossref","is-referenced-by-count":9,"title":["Packing Steiner Forests"],"prefix":"10.1007","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Chekuri, C., Shepherd, B.: Approximate integer decompositions for undirected network design problems (2004) (Manuscript)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-30140-0_18","volume-title":"Algorithms \u2013 ESA 2004","author":"J. Cheriyan","year":"2004","unstructured":"Cheriyan, J., Salavatipour, M.: Hardness and approximation results for packing Steiner trees problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 180\u2013191. Springer, Heidelberg (2004)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0166-218X(02)00463-8","volume":"131","author":"A. Fr\u00e1nk","year":"2003","unstructured":"Fr\u00e1nk, A., Kir\u00e1ly, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Applied Mathematics\u00a0131, 373\u2013383 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forests problems. SIAM Journal on Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR5","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\u00a021, 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"27_CR6","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: Proceedings of the 14th Annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 266\u2013274 (2003)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0095-8956(02)00013-8","volume":"88","author":"M. Kriesell","year":"2003","unstructured":"Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Combin. Theory, Series B\u00a088, 53\u201363 (2003)","journal-title":"J. Combin. Theory, Series B"},{"key":"27_CR8","unstructured":"Kriesell, M.: Disjoint Steiner trees in graphs without large bridges (2004) (manuscript)"},{"key":"27_CR9","unstructured":"Lau, L.C.: An approximate max-Steiner-tree-packing min-Steiner-cut theorem. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 61\u201370 (2004)"},{"key":"27_CR10","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)","journal-title":"Ann. Discrete Math."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math.\u00a010, 95\u2013115 (1927)","journal-title":"Fund. Math."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.S..J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"27_CR13","first-page":"43","volume":"145","author":"L. Petingi","year":"2000","unstructured":"Petingi, L., Rodriguez, J.: Bounds on the maximum number of edge-disjoint Steiner trees of a graph. Congressus Numerantium\u00a0145, 43\u201352 (2000)","journal-title":"Congressus Numerantium"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc.\u00a036, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:22Z","timestamp":1619491222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11496915_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}