Minimum-cost single-source 2-splittable flow

Information Processing Letters

Volumn 94, Issue 1, 2005, Pages 15-18

  Kolliopoulos, Stavros G ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Analysis of algorithms; Approximation algorithms; Graph algorithms; Maximum flow; Unsplittable flow

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BUDGET CONTROL; COMPUTATIONAL METHODS; CONSTRAINT THEORY; COSTS; GRAPH THEORY;

ANALYSIS OF ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; MAXIMUM FLOW; UNSPLITTABLE FLOW;

PROBLEM SOLVING;

EID: 13844320055     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.12.009     Document Type: Article

References (9)

1. G. Baier, E. Köhler, M. Skutella, On the k-splittable flow problem, Algorithmica (special issue on ESA 2002), in press
2. Y. Dinitz, N. Garg, and M.X. Goemans On the single-source unsplittable flow problem Combinatorica 19 1999 1 25
3. T. Erlebach, and A. Hall NP-hardness of broadcast sheduling and inapproximability of single-source unsplittable min-cost flow Proc. 13th ACM-SIAM Symp. on Discrete Algorithms 2002
4. J.M. Kleinberg, Approximation algorithms for disjoint paths problems, PhD thesis, MIT, Cambridge, MA, May 1996
5. J.M. Kleinberg Single-source unsplittable flow Proc. 37th Annual IEEE Symp. on Foundations of Computer Science October 1996 68 77
6. S.G. Kolliopoulos, and C. Stein Approximation algorithms for single-source unsplittable flow SIAM J. Comput. 31 2002 919 946
7. S.G. Kolliopoulos, and C. Stein Approximating disjoint-path problems using packing integer programs Math. Programming A 99 2004 63 87
8. D.B. Shmoys, and É. Tardos An approximation algorithm for the generalized assignment problem Math. Programming A 62 1993 461 474
9. M. Skutella Approximating the single-source unsplittable min-cost flow problem Math. Programming B 91 2002 493 514