Approximation and complexity of k-splittable flows

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

Volumn 3879 LNCS, Issue , 2006, Pages 244-257

  Koch, Ronald ^a   Skutella, Martin ^a   Spenke, Ines ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

K PATHS; K-SPLITTABLE FLOWS; MAXIMUM K-SPLITTABLE FLOW (MKSF); UNSPLITTABLE FLOW PROBLEMS;

APPROXIMATION THEORY;

EID: 33745624867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671411_19     Document Type: Conference Paper

References (16)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8:277-284, 1987.
3. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
4. A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler, Algorithms for faulttolerant routing in circuit-switched networks. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 265-274, ACM Press, 2002.
5. G. Baier. Flows with Path Restrictions. PhD thesis, TU Berlin, 2003.
6. G. Baier, E. Köhler, and M. Skutella. On the k-splittable flow problem. Algorithmica, 42:231-248, 2005.
7. H. L. Bodlaender. Dynamic programming on graphs of bounded treewidth. In Proceedings 15th International Colloquium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 105-118. Springer, Berlin, 1988.
8. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305-1317, 1996.
9. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In I. Privara and P. Ruzicka, editors, Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, volume 1295 of Lecture Notes in Computer Science, pages 19-36. Springer, Berlin, 1997.
10. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
11. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, and Prabhakar Ragde. Characterizations of k-terminal flow networks and computing network flows in partial k-trees. In Proceedings 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 641-649, 1995.
12. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, M.I.T., 1996.
13. P. Krysta, P. Sanders, and B. Vöcking. Scheduling and traffic allocation for tasks with bounded splittability. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, volume 2747, pages 500-510. Springer, Berlin, 2003.
14. M. Martens and M. Skutella, Flows on few paths: Algorithms and lower bounds. In S. Albers and T. Radzik, editors, Algorithms - ESA '04, volume 3221 of Lecture Notes in Computer Science, pages 520-531. Springer, Berlin, 2004.
15. N. Robertson and P. D. Seymour. Graph minors. ii: algorithmic aspects of treewidth. Journal of Algorithms, 7:309-322, 1986.
16. P. Schemer. A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical Report 396, FU Berlin, Fachbereich 3 Mathematik, 1994.