{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:10:43Z","timestamp":1736140243568,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309000"},{"type":"electronic","value":"9783540322931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_69","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T14:48:12Z","timestamp":1132843692000},"page":"688-697","source":"Crossref","is-referenced-by-count":3,"title":["Packing Trees in Communication Networks"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Saad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/S1052623497318013","volume":"9","author":"K.M. Anstreicher","year":"1999","unstructured":"Anstreicher, K.M.: Towards a practical volumetric cutting plane method for convex programming. SIAM J. Optimization\u00a09, 190\u2013206 (1999)","journal-title":"SIAM J. Optimization"},{"key":"69_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1051\/ro:2004028","volume":"38","author":"A. Baltz","year":"2004","unstructured":"Baltz, A., Srivastav, A.: Fast approximation of minimum multicast congestion- implementation versus theory. RAIRO Oper. Res.\u00a038, 319\u2013344 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett.\u00a032, 171\u2013176 (1989)","journal-title":"Inf. Process. Lett."},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00453-003-1054-1","volume":"38","author":"M. Cai","year":"2004","unstructured":"Cai, M., Deng, X., Wang, L.: Minimum k arborescences with bandwidth constraints. Algorithmica\u00a038, 529\u2013537 (2004)","journal-title":"Algorithmica"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"Carr, R., Vempala, S.: Randomized meta-rounding. In: Proceedings of STOC 2000, pp. 58\u201362 (2000)","DOI":"10.1145\/335305.335312"},{"issue":"3","key":"69_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/90.851977","volume":"8","author":"S. Chen","year":"2000","unstructured":"Chen, S., G\u00fcnl\u00fck, O., Yener, B.: The multicast packing problem. IEEE\/ACM Trans. Networking\u00a08(3), 311\u2013318 (2000)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"69_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of FOCS 1998, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"69_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res.\u00a02, 321\u2013340 (1996)","journal-title":"Math. Oper. Res."},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"69_CR10","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: Proceedings of SODA 2003, pp. 266\u2013274 (2003)"},{"key":"69_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings of TCS 2002, pp. 255\u2013266 (2002)","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"69_CR12","unstructured":"Jansen, K., Zhang, H.: An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In: Proceedings of ARACNE 2002, pp. 77\u201390 (2002)"},{"key":"69_CR13","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","volume":"20","author":"X. Jia","year":"1997","unstructured":"Jia, X., Wang, L.: A group multicast routing algorithm by using multiple minimum Steiner trees. Comput. Commun.\u00a020, 750\u2013758 (1997)","journal-title":"Comput. Commun."},{"key":"69_CR14","unstructured":"Lau, L.C.: An approximate max-Steiner-tree-packing min-Steiner-cut theorem. In: Proceedings of STOC 2004, pp. 61\u201370 (2004)"},{"key":"69_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/11496915_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"L.C. Lau","year":"2005","unstructured":"Lau, L.C.: Packing Steiner forests. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 362\u2013376. Springer, Heidelberg (2005)"},{"key":"69_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11427186_15","volume-title":"Experimental and Efficient Algorithms","author":"Q. Lu","year":"2005","unstructured":"Lu, Q., Zhang, H.: Implementation of approximation algorithms for the multicast congestion problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 152\u2013164. Springer, Heidelberg (2005)"},{"key":"69_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"2","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res.\u00a02, 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"key":"69_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci.\u00a037, 130\u2013143 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"69_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"69_CR20","unstructured":"Saad, M., Terlaky, T., Vannelli, A., Zhang, H.: A provably good global routing algorithm in multilayer IC and MCM layout designs. Technical Report, AdvOL #2005-15, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada, http:\/\/www.cas.mcmaster.ca\/~oplab\/research.htm"},{"key":"69_CR21","doi-asserted-by":"crossref","unstructured":"Saad, M., Terlaky, T., Vannelli, A., Zhang, H.: Packing Trees in Communication Networks, Technical Report, AdvOL #2005-14, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada, http:\/\/www.cas.mcmaster.ca\/~oplab\/research.htm","DOI":"10.1007\/11600930_69"},{"key":"69_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/11602613_104","volume-title":"Algorithms and Computation","author":"T. Terlaky","year":"2005","unstructured":"Terlaky, T., Vannelli, A., Zhang, H.: On routing in VLSI design and communication networks. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1051\u20131060. Springer, Heidelberg (2005)"},{"key":"69_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-46632-0_37","volume-title":"Algorithms and Computations","author":"S. Vempala","year":"1999","unstructured":"Vempala, S., V\u00f6cking, B.: Approximating multicast congestion. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 367\u2013372. Springer, Heidelberg (1999)"},{"key":"69_CR24","series-title":"LNEMS","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume-title":"Network Optimization","author":"J. Villavicencio","year":"1997","unstructured":"Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. LNEMS, vol.\u00a0450, pp. 471\u2013485. Springer, Berlin (1997)"},{"key":"69_CR25","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of SODA, pp. 170\u2013178 (1995)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:34:02Z","timestamp":1736116442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11600930_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}