Length-bounded cuts and flows

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

Volumn 4051 LNCS, Issue , 2006, Pages 679-690

  Baier, Georg ^a,e   Erlebach, Thomas ^b   Hall, Alexander ^c   Köhler, Ekkehard ^a   Schilling, Heiko ^a   Skutella, Martin ^d  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c ETH ZURICH   (Switzerland)

^d TU DORTMUND UNIVERSITY   (Germany)

^e SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; PROBLEM SOLVING;

INTEGRALITY GAPS; LENGTH-BOUNDED CUTS; NODE-CUTS; S-I-PATHS;

GRAPH THEORY;

EID: 33746373962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_59     Document Type: Conference Paper

References (24)

1. Menger, K.: Zur allgemeinen Kurventheorie. Fund. Mathematicae (1927) 96-115
2. Dantzig, G.B., Fulkerson, D.H.: On the max flow min cut theorem of networks. In Kühn, H.W., Tucker, A.W., eds.: Linear Inequalities and Related Systems. Volume 38 of Annals of Math. Studies. Princeton University Press (1956) 215-221
3. Kotzig, A.: Connectivity and Regular Connectivity of Finite Graphs. PhD thesis, Vysoká Škola Ekonomická, Bratislava, Slovakia (1956)
4. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 9 (1956) 399-404
5. Elias, P., Feinstein, A., Shannon, C.E.: A note on the maximum flow through a network. IRE Transactions on Information Theory 2 (1956)
6. Lovász, L., Neumann Lara, V., Plummer, M.D.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica 9 (1978) 269-276
7. Exoo, G.: On line disjoint paths of bounded length. Discrete Mathematics 44 (1983) 317-318
8. Niepel, L., Safaríková, D.: On a generalization of Menger's Theorem. Acta Mathematica Universitatis Comenianae 42 (1983) 275-284
9. Bondy, J.A., Murty, U.: Graph Theory with Applications. North Holland (1976)
10. Boyles, S.M., Exoo, G.: A counterexample to a conjecture on paths of bounded length. Journal of Graph Theory 6 (1982) 205-209
11. Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12 (1982) 277-286
12. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the Symposium on Theory of Computing, ACM (1999) 19-28
13. Baier, G.: Flows with Path Restrictions. PhD thesis, TU Berlin, Germany (2003)
14. Mahjoub, A.R., McCormick, S.T.: The complexity of max flow and min cut with bounded-length paths, unpublished Manuscript (2003)
15. Perl, Y., Ronen, D.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14 (1984) 531-544
16. Brandes, U., Neyer, G., Wagner, D.: Edge-disjoint paths in planar graphs with short total length. Technical Report 19, Universität Konstanz (1996)
17. Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1) (1995) 135-150
18. Hsu, D.: On container width and length in graphs, groups, and networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E77-A(4) (1994)
19. Kolman, P.: Personal communication (2006)
20. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1) (2005) 439-486
21. Galil, Z., Yu, X.: Short length versions of Menger's Theorem. In: Proceedings of the Symposium on Theory of Computing, ACM (1995) 499-508
22. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the Symposium on Discrete Algorithms, ACM (2002) 184-193
23. Correa, J.R., Schulz, A.S., Stier Moses, N.B.: Fast, fair, and efficient flows in networks. In: Operations Research, INFORMS (2006) to appear.
24. Raghavan, P., Thompson, C.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987) 365-374