{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:40:26Z","timestamp":1737358826270,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_22","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"165-177","source":"Crossref","is-referenced-by-count":4,"title":["Fast Approximation of Minimum Multicast Congestion \u2014 Implementation versus Theory"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Baltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J. of the Association for Computing Machinery 44(3), 486\u2013504, 1997.","journal-title":"J. of the Association for Computing Machinery"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"R. Carr, S. Vempala, Randomized Metarounding, Proc. of the 32nd ACM Symposium on the theory of computing (STOC\u2019 00), Portland, USA, 58\u201362, 2000","DOI":"10.1145\/335305.335312"},{"key":"22_CR3","unstructured":"N. Garg, J. K\u00f6nemann, Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In Proc. 39th IEEE Annual Symposium on Foundations of Computer Science, 1998."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(92)90032-Q","volume":"42","author":"A.V. Goldberg","year":"1992","unstructured":"A.V. Goldberg, A natural randomization strategy for multicommodity flow and related algorithms, Information Processing Letters 42, 249\u2013256, 1992.","journal-title":"Information Processing Letters"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg, A.D. Oldham, S. Plotkin, C. Stein, An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flows. In Proc. 6th Conf. on Integer Prog. and Combinatorial Optimization, 1998.","DOI":"10.1007\/3-540-69346-7_26"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"M.D. Grigoriadis, L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J. on Optimization 4, 86\u2013107, 1994.","journal-title":"SIAM J. on Optimization"},{"key":"22_CR7","unstructured":"K. Jansen, H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, In Proc. 3rd Int. Worksh. on Approx. and Random. Alg. in Commun. Netw. (ARANCE\u201902), Roma, Italy, September 21, 2002."},{"key":"22_CR8","unstructured":"K. Jansen, H, Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, In Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS\u201902), Montr\u00e9al, Qu\u00e9bec, Canada, August 25\u201330, 2002."},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/S0097539792241175","volume":"23","author":"P. Klein","year":"1994","unstructured":"P. Klein, S. Plotkin, C. Stein, E. Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts, SIAM J. on Computing 23 No. 3, 466\u2013487, 1994.","journal-title":"SIAM J. on Computing"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jcss.1995.1020","volume":"50","author":"T. Leighton","year":"1995","unstructured":"T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J. of Comp. and System Sciences 50, 228\u2013243, 1995.","journal-title":"J. of Comp. and System Sciences"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"D.W. Matula","year":"1990","unstructured":"D.W. Matula, F. Shahrokhi, The maximum concurrent flow problem, J. of the Association for Computing Machinery 37, 318\u2013334, 1990.","journal-title":"J. of the Association for Computing Machinery"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters 27, 125\u2013128, 1988.","journal-title":"Information Processing Letters"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S. Plotkin","year":"1995","unstructured":"S. Plotkin, D. Shmoys, E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res. 20, 257\u2013301, 1995.","journal-title":"Math. Oper. Res."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0025-5610(96)00072-X","volume":"78","author":"T. Radzik","year":"1997","unstructured":"T. Radzik, Fast deterministic approximation for the multicommodity flow problem, Math. Prog. 78, 43\u201358, 1997.","journal-title":"Math. Prog."},{"key":"22_CR15","first-page":"683","volume":"38","author":"P. Raghavan","year":"1994","unstructured":"P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. of Comp. and System Sciences 38, 683\u2013707, 1994.","journal-title":"J. of Comp. and System Sciences"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(99)00133-X","volume":"99","author":"A. Srivastav","year":"2000","unstructured":"A. Srivastav, P. Stangier, On complexity, representation and approximation of integral multicommodity flows, Discrete Applied Mathematics 99, 183\u2013208, 2000.","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"S. Vempala, B. V\u00f6cking, Approximating Multicast Congestion, Proc. 10th ISAAC, Chennai, India, 1999.","DOI":"10.1007\/3-540-46632-0_37"},{"key":"22_CR18","unstructured":"G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, Proc. of the 11th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), 770\u2013779, 2000."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:26:41Z","timestamp":1737358001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}