On the approximation of the single source k-splittable flow problem

Journal of Discrete Algorithms

Volumn 6, Issue 2, 2008, Pages 277-289

  Caramia, Massimiliano ^a   Sgalambro, Antonino ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

k splittable flow; Multicommodity; Single source; Throughput; Unsplittable

Indexed keywords

APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); HEURISTIC ALGORITHMS; PROBLEM SOLVING;

K SPLITTABLE FLOW; MULTICOMMODITY; SINGLE SOURCE; UNSPLITTABLE;

APPROXIMATION ALGORITHMS;

EID: 42249094882     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2007.03.001     Document Type: Article

References (16)

1. M. Andrews, L. Zhang, Hardness of the undirected congestion minimization problem, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
2. Baier G., Köhler E., and Skutella M. On the k-splittable flow problem. Algorithmica 42 (2005) 231-248
3. J. Chuzhoy, J. Naor, New hardness results for congestion minimization and machine scheduling, in: Proceedings of the 36th Annual ACM Symposium of Theory of Computing, Chicago, IL, 2004, pp. 28-34
4. Dinitz Y., Garg N., and Goemans M.X. On the single-source unsplittable flow problem. Combinatorica 19 (1999) 17-41
5. Du J., and Kolliopoulos S.G. Implementing approximation algorithms for single-source unsplittable flow. Proceedings of the 3rd Int. Workshop on Efficient and Experimental Algorithms (WEA). Lecture Notes in Computer Science vol. 3059 (2004), Springer, Berlin 213-227
6. T. Erlebach, A. Hall, NP-hardness of broadcast sheduling and inapproximability of single-source unsplittable min-cost flow, in: Proceedings of the 13th ACM-SIAM SODA, 2002, pp. 194-202
7. J. Kleinberg, Approximation algorithms for disjoint paths problems, PhD thesis, MIT, 1996
8. J. Kleinberg, Single-source unsplittable flow, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 68-77
9. Koch R., Skutella M., and Spenke I. Approximation and complexity of k-splittable flows. In: Erlebach T., and Persiano P. (Eds). WAOA. Lecture Notes in Computer Science (2005), Springer, Berlin 244-257
10. S.G. Kolliopoulos, Improved approximation algorithms for unsplittable flow problems, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 426-435
11. Kolliopoulos S.G., and Stein C. Experimental evaluation of approximation algorithms for single-source unsplittable flow. Proceedings of the 7th Integer Programming and Combinatorial Optimization (IPCO) Conference. Lecture Notes in Computer Science vol. 1610 (1999), Springer, Berlin 153-168
12. Kolliopoulos S.G. Minimum-cost single-source 2-splittable flow. Information Processing Letters 9 1 (2005) 15-18
13. Lenstra J.K., Shmoys D.B., and Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46 (1990) 259-271
14. M. Martens, M. Skutella, Flows on few paths: Algorithms and lower bounds, in: Proceedings of the 12th Annual European Symposium on Algorithms, 2004, pp. 520-531
15. Martens M., and Skutella M. Length-bounded and dynamic k-splittable flows. In: Haasis H.-D., Kopfer H., and Schönberger J. (Eds). Operations Research Proceedings 2005 (2006), Springer, Berlin 297-302
16. Skutella M. Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91 (2002) 493-514