Multicommodity demand flow in a tree (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 410-425

  Chekuri, Chandra ^a   Mydlarz, Marcelo ^b   Shepherd, F Bruce ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Integer multicommodity flow; Integrality gap; Packing integer program; Tree

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FORESTRY; LINEAR PROGRAMMING; PROFITABILITY; TREES (MATHEMATICS);

INTEGER MULTICOMMODITY FLOW PROBLEM; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; MULTI-COMMODITY FLOW; MULTICOMMODITY DEMANDS; PACKING INTEGER PROGRAMS; PRIMAL DUAL ALGORITHMS; TREE;

INTEGER PROGRAMMING;

EID: 35248848767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_34     Document Type: Article

References (18)

1. 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-90, 2001.
2. Preliminary version in Proc. of STOC 2000.
3. G. Calinescu, A. Chakrabarti, H. Karloff, Y. Rabani. Improved Approximation Algorithms for Resource Allocation. Proc. of IPCO, 2002.
4. A. Chakrabarti, C. Chekuri, A. Gupta, A. Kumar. Approximation Algorithms for the Unsplittable Flow Problem. Proc. of APPROX, 2002.
5. J. Cheriyan, T. Jordan, R. Ravi. On 2-coverings and 2-packings of laminar families. Proc. of ESA, 1999.
6. N. Garg, V. Vazirani, M. Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica, 18(1):3-20, 1997.
7. Preliminary version appeared in Proc. of ICALP, 1993.
8. 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.
9. Preliminary version appeared in Proc. of STOC, 1999.
10. T. Erlebach, A. Pagourtzis, K. Potika, S. Stefanakos. Resource allocation problems in Multifiber WDM Tree Networks. Manuscript, March 2003.
11. S. G. Kolliopoulos, C. Stein, Approximation Algorithms for Single-Source Unsplittable Flow, SIAM J. Computing (31), 919-946, 2002;
12. preliminary version in Proc. of FOCS, 1997.
13. S. G. Kolliopoulos C. Stein. Approximating Disjoint-Path Problems using Packing Integer Programs, Proc. of IPCO, 1998.
14. P. Raghavan, E. Upfal. Efficient routing in all-optical networks. Proc. STOC, 1994.
15. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1986.
16. F.B. Shepherd, Lisa Zhang. An Augmentation Algorithm for Mincost Multicommodity Flow on a Ring, Discrete Applied Mathematics 110, 2001, 301-315.
17. F.B. Shepherd, A. Vetta. The Demand Matching Problem. Proc. of IPCO, 2002.
18. L. Wolsey, private communication, Oberwolfach, 2002.