{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:43:51Z","timestamp":1787499831777,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_34","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"410-425","source":"Crossref","is-referenced-by-count":19,"title":["Multicommodity Demand Flow in a Tree"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcelo","family":"Mydlarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. Bruce","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"5","key":"34_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber. A unified approach to approximating resource allocation and scheduling. JACM, 48(5), 1069\u201390, 2001. Preliminary version in Proc. of STOC 2000.","journal-title":"JACM"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"G. Calinescu, A. Chakrabarti, H. Karloff, Y. Rabani. Improved Approximation Algorithms for Resource Allocation. Proc. of IPCO, 2002.","DOI":"10.1007\/3-540-47867-1_28"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti, C. Chekuri, A. Gupta, A. Kumar. Approximation Algorithms for the Unsplittable Flow Problem. Proc. of APPROX, 2002.","DOI":"10.1007\/3-540-45753-4_7"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, T. Jordan, R. Ravi. On 2-coverings and 2-packings of laminar families. Proc. of ESA, 1999.","DOI":"10.1007\/3-540-48481-7_44"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"N. Garg, V. Vazirani, M. Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica, 18(1):3\u201320, 1997. Preliminary version appeared in Proc. of ICALP, 1993.","journal-title":"Algorithmica"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman. F. B. Shepherd, M. Yannakakis. Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems, To appear in: JCSS. Preliminary version appeared in Proc. of STOC, 1999.","DOI":"10.1145\/301250.301262"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"T. Erlebach, A. Pagourtzis, K. Potika, S. Stefanakos. Resource allocation problems in Multifiber WDM Tree Networks. Manuscript, March 2003.","DOI":"10.1007\/978-3-540-39890-5_19"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"S. G. Kolliopoulos","year":"2002","unstructured":"S. G. Kolliopoulos, C. Stein, Approximation Algorithms for Single-Source Unsplittable Flow, SIAM J. Computing (31), 919\u2013946, 2002; preliminary version in Proc. of FOCS, 1997.","journal-title":"SIAM J. Computing"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"S. G. Kolliopoulos C. Stein. Approximating Disjoint-Path Problems using Packing Integer Programs, Proc. of IPCO, 1998.","DOI":"10.1007\/3-540-69346-7_12"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal. Efficient routing in all-optical networks. Proc. STOC, 1994.","DOI":"10.1145\/195058.195119"},{"key":"34_CR11","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1986."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0166-218X(00)00252-3","volume":"110","author":"F.B. Shepherd","year":"2001","unstructured":"F.B. Shepherd, Lisa Zhang. An Augmentation Algorithm for Mincost Multicommodity Flow on a Ring, Discrete Applied Mathematics 110, 2001, 301\u2013315.","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"F.B. Shepherd, A. Vetta. The Demand Matching Problem. Proc. of IPCO, 2002.","DOI":"10.1007\/3-540-47867-1_32"},{"key":"34_CR14","unstructured":"L. Wolsey, private communication, Oberwolfach, 2002."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:13:32Z","timestamp":1556666012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}