{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:40:09Z","timestamp":1740264009236,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_15","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"152-164","source":"Crossref","is-referenced-by-count":7,"title":["Implementation of Approximation Algorithms for the Multicast Congestion Problem"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of the ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"15_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the Association for Computing Machinery\u00a044(3), 486\u2013504 (1997)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"15_CR3","unstructured":"Baltz, A., Srivastav, A.: Fast approximation of multicast congestion (2001) (manuscript)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44849-7_22","volume-title":"Algorithms and Complexity","author":"A. Baltz","year":"2003","unstructured":"Baltz, A., Srivastav, A.: Fast approximation of minimum multicast congestion - implementation versus theory. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653. Springer, Heidelberg (2003)"},{"key":"15_CR5","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. Information Professing Letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Professing Letters"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Carr, R., Vempala, S.: Randomized meta-rounding. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing, STOC 2000, pp. 58\u201362 (2000)","DOI":"10.1145\/335305.335312"},{"issue":"3","key":"15_CR7","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 Transactions on Networking\u00a08(3), 311\u2013318 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Algorithm Theory - SWAT 2002","author":"M. Chleb\u00edk","year":"2002","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of the Steiner tree problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 170\u2013179. Springer, Heidelberg (2002)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(91)90096-Z","volume":"38","author":"R. Floren","year":"1991","unstructured":"Floren, R.: A note on \u201cA faster approximation algorithm for the Steiner problem in graphs\u201d. Information Processing Letters\u00a038, 177\u2013178 (1991)","journal-title":"Information Processing Letters"},{"key":"15_CR10","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 the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization\u00a04, 86\u2013107 (1994)","journal-title":"SIAM Journal on Optimization"},{"key":"15_CR12","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. Mathematics of Operations Research\u00a02, 321\u2013340 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, pp. 255\u2013266 (2002)","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"15_CR14","unstructured":"Jansen, K., Zhang, H.: An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In: Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks, ARACNE 2002, pp. 77\u201390 (2002)"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, NY (1972)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/S0097539792241175","volume":"23","author":"P. Klein","year":"1994","unstructured":"Klein, P., Plotkin, S., Stein, C., Tardos, E.: Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing\u00a023, 466\u2013487 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters\u00a027, 125\u2013128 (1988)","journal-title":"Information Processing Letters"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardolos, P.M.: A survey of combinatorial optimization problems in multicast routing. Computers and Operations Research\u00a032, 1953\u20131981 (2005)","journal-title":"Computers and Operations Research"},{"key":"15_CR19","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. Journal of Computer and System Science\u00a037, 130\u2013143 (1988)","journal-title":"Journal of Computer and System Science"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"15_CR21","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 770\u2013779 (2000)"},{"key":"15_CR22","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":"15_CR23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-99789-1_25","volume-title":"Applied Mathematics and Parallel Computing","author":"J. Villavicencio","year":"1996","unstructured":"Villavicencio, J., Grigoriadis, M.D.: Approximate structured optimization by cyclic block-coordinate descent. In: Fisher, H., et al. (eds.) Applied Mathematics and Parallel Computing, pp. 359\u2013371. Physica Verlag, Heidelberg (1996)"},{"key":"15_CR24","series-title":"Lecture Notes in Economics and Mathematical Systems","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. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0450, pp. 471\u2013485. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:00:39Z","timestamp":1740261639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11427186_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}