Length-bounded cuts and flows

ACM Transactions on Algorithms

Volumn 7, Issue 1, 2010, Pages

  Baier, Georg ^a   Erlebach, Thomas ^b   Hall, Alexander ^c   Köhler, Ekkehard ^d   Kolman, Petr ^e   Pangrác, Ondřej ^e   Schilling, Heiko ^f,g   Skutella, Martin ^h  

^a SIEMENS AG   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c GOOGLE   (Switzerland)

^d BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

^e CHARLES UNIVERSITY   (Czech Republic)

^f TomTom International BV ^*  (Netherlands)

^g Euston Tower ^*  (United Kingdom)

^h TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Flows and cuts in graphs; Graphs

Indexed keywords

APPROXIMATION RATIOS; BOUNDED FLOW; COMPLEXITY RESULTS; EDGE CUTS; EDGE LENGTH; FLOW PATH; FLOWS AND CUTS IN GRAPHS; GRAPH G; GRAPHS; NP COMPLETE; NP-HARD; OPTIMAL SOLUTIONS; WORST CASE;

COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; STRUCTURAL OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 78650653050     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1868237.1868241     Document Type: Article

References (35)

1. ADÁMEK, J., AND KOUBEK, V. 1971. Remarks on flows in network with short paths. Commentationes Mathematicae Universitatis Carolinae 12, 4, 661-667.
2. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. BAIER, G. 2003. Flows with path restrictions. Ph.D. dissertation, TU Berlin, Germany.
4. BAIER, G., ERLEBACH, T., HALL, A., KÖHLER, E., SCHILLING, H., AND SKUTELLA, M. 2006. Lengthbounded cuts and flows. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4051. Springer-Verlag, Berlin, 679-690.
5. BEN-AMEUR,W. 2000. Constrained length connectivity and survivable networks. Networks 36, 1, 17-33.
6. BLEY, A. 2003. On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12, 3-4, 131-149.
7. BONDY, J. A., AND MURTY, U. 1976. Graph Theory with Applications. North Holland, New York, NY.
8. BOYLES, S. M., AND EXOO, G. 1982. A counterexample to a conjecture on paths of bounded length. J. Graph Theor. 6, 205-209.
9. BRANDES, U.,NEYER, G., ANDWAGNER, D. 1996. Edge-disjoint paths in planar graphs with short total length. Tech. rep. 19. Universität Konstanz, Koustanz, Germany.
10. BRUCKER, P. 2001. Scheduling Algorithms, 3rd ed. Springer-Verlag, Berlin, Germany.
11. CHEKURI, C., AND KHANNA, S. 2007. Edge-disjoint paths revisited. ACM Trans. Algo. 3, 4, Article No. 46.
12. CORREA, J. R., SCHULZ, A. S., AND STIERMOSES, N. E. 2007. Fast, fair, and efficient flows in networks. Oper. Res. 55, 2, 215-225.
13. DANTZIG, G. B., AND FULKERSON, D. R. 1956. On the max-flow min-cut theorem of networks. In Linear Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker, Eds. Number 38 in Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 215-221.
14. DINUR, I., AND SAFRA, S. 2005. On the hardness of approximating minimum vertex cover. Ann. Math. 162, 1, 439-486.
15. ELIAS, P., FEINSTEIN, A., AND SHANNON, C. E. 1956. A note on the maximum flow through a network. IRE Trans. Inform. Theor. 2, 117-119.
16. EVEN, S., AND TARJAN, R. E. 1975. Network flow and testing graph connectivity. SIAM J. Comput. 4, 507-518.
17. EXOO, G. 1983. On line disjoint paths of bounded length. Discrete Math. 44, 317-318.
18. FORD, L. R., AND FULKERSON, D. R. 1956. Maximal flow through a network. Canad. J. Math. 8, 399-404.
19. FORD, L. R., AND FULKERSON, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
20. GALIL, Z., AND YU, X. 1995. Short length versions of Menger's Theorem. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, NY 499-508.
21. GURUSWAMI, V., KHANNA, S., RAJARAMAN, R., SHEPHERD, B., AND YANNAKAKIS, M. 2003. Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 3, 473-496.
22. HSU, D. F. 1994. On container width and length in graphs, groups, and networks. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E77-A, 4, 668-680.
23. ITAI, A., PERL, Y., AND SHILOACH, Y. 1982. The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277-286.
24. KLEINBERG, J. 1996. Approximation algorithms for disjoint paths problems. Ph.D. dissertation. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
25. KOLMAN, P., AND SCHEIDELER, C. 2006. Improved bounds for the unsplittable flow problem. J. Algor. 61, 1, 20-44.
26. KOTZIG, A. 1956. Connectivity and regular connectivity of finite graphs. Ph.D. dissertation, Vysoká Škola Ekonomická, Bratislava, Slovakia.
27. LOVÁSZ, L.,NEUMANN-LARA,V., AND PLUMMER,M.D. 1978. Mengerian theorems for paths of bounded length. Period. Math. Hungar. 9, 269-276.
28. MAHJOUB, A. R., ANDMCCORMICK, S. T. 2003. The complexity of max-flow and min-cut with boundedlength paths. Unpublished Manuscript.
29. MENGER, K. 1927. Zur allgemeinen Kurventheorie. Fund. Math. 10, 96-115.
30. NIEPEL, L., AND SAFARÍKOVÁ, D. 1983. On a generalization of Menger's Theorem. Acta Mathematica Universitatis Comenianae 42, 275-284.
31. PERL, Y., AND RONEN, D. 1984. Heuristics for finding a maximum number of disjoint bounded paths. Networks 14, 531-544.
32. PYBER, L., AND TUZA, Z. 1993. Menger-type theorems with restrictions on path lengths. Discrete Math. 120, 1-3, 161-174.
33. RAGHAVAN, P., AND THOMPSON, C. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 4, 365-374.
34. VAN DER HOLST, H., AND DE PINA, J. C. 2002. Length-bounded disjoint paths in planar graphs. Discrete Appl. Math. 120, 1-3, 251-261.
35. WAGNER, D., AND WEIHE, K. 1995. A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15, 1, 135-150.