On the k-splittable flow problem

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

Volumn 2461, Issue , 2002, Pages 101-113

  Baier, Georg ^a   Köhler, Ekkehard ^a   Skutella, Martin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATION RESULTS; CAPACITY CONSTRAINTS; FOCUS OF RESEARCHES; HARDNESS OF APPROXIMATION; MULTI-COMMODITY FLOW; REAL-LIFE APPLICATIONS; ROUTING PROBLEMS; UNSPLITTABLE FLOW;

APPROXIMATION ALGORITHMS;

EID: 84938056886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_13     Document Type: Conference Paper

References (16)

1. Ahuja, R.K., Magnanti, T. L., Orlin, J. B.: Network Flows. Prentice-Hall (1993) 102, 105
2. Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. PhD thesis, MIT (1996) 103, 104, 111
3. Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science. (1996) 68–77 103, 111
4. Baier, G., Köhler, E., Skutella, M.: On the k-splittable flow problem. Technical Report 739, Technische Universit¨at Berlin (2002) 103, 104
5. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization. (1998) 103
6. Kolliopoulos, S.G., Stein, C.: Improved approximation algorithms for unsplittable flow problems. In: Procceedings of the 38th Annual Symposium on Foundations of Computer Science. (1997) 426–435 103, 111
7. Kolliopoulos, S.G.: Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems. PhD thesis, Dartmouth College (1998) 103
8. Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25 (2000) 255–280 103
9. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjointpaths and related problems. In: Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing. (1999) 19–28 103
10. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms. (2002) 184–193 103
11. Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization. (2001) 15–29 103
12. Dinitz, Y., Garg, N., Goemans, M. X.: On the single-source unsplittable flow problem. Combinatorica 19 (1999) 17–41 103
13. Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91 (2002) 493–514 103, 111, 112
14. Bagchi, A., Chaudhary, A., Scheideler, C., Kolman, P.: Algorithms for faulttolerant routing in circuit switched networks. In: Fourteenth ACM Symposium on Parallel Algorithms and Architectures. (2002) To appear 103
15. Krysta, P., Sanders, P., Vöcking, B.: Scheduling and traffic allocation for tasks with bounded splittability (2002) Manuscript 104
16. Raghavan, P., Thompson, C.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987) 365–374 111