Approximability of 3- and 4-hop bounded disjoint paths problems

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

Volumn 6080 LNCS, Issue , 2010, Pages 205-218

  Bley, Andreas ^a   Neto, Jose ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b INSTITUT TELECOM   (France)

Author keywords

approximation algorithms; complexity; Graph algorithms; length bounded paths

Indexed keywords

APPROXIMABILITY; COMMUNICATION NETWORKS; COMPLEXITY; DISJOINT PATHS PROBLEM; EDGE WEIGHTS; FAULT-TOLERANT; FLOW PROBLEMS; GRAPH ALGORITHMS; GRAPH G; MINIMUM WEIGHT; NODE-DISJOINT; NODE-DISJOINT PATHS; POLYNOMIAL-TIME; SUBGRAPHS;

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77954393110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_16     Document Type: Conference Paper

References (29)

1. Alevras, D., Grötschel, M., Wessäly, R.: Capacity and survivability models for telecommunication networks. ZIB Technical Report SC-97-24, Konrad-Zuse- Zentrum für Informationstechnik Berlin (1997)
2. Gouveia, L., Patricio, P., Sousa, A.D.: Compact models for hop-constrained node survivable network design: An application to MPLS. In: Anandaligam, G., Raghavan, S. (eds.) Telecommunications Planning: Innovations in Pricing, Network Design and Management. Springer, Heidelberg (2005)
3. Gouveia, L., Patricio, P., Sousa, A.D.: Hop-constrained node survivable network design: An application to MPLS over WDM. Networks and Spatial Economics 8(1) (2008)
4. Grötschel, M., Monma, C., Stoer, M.: Design of Survivable Networks. In: Handbooks in Operations Research and Management Science, Volume Networks, pp. 617-672. Elsevier, Amsterdam (1993)
5. Chakraborty, T., Chuzhoy, J., Khanna, S.: Network design for vertex connectivity. In: Proceedings of the 40th Annual ACM Symposium on the Theory of Computing (STOC '08), pp. 167-176 (2008)
6. Chekuri, C., Khanna, S., Shepherd, F.: An O (√n) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing 2, 137-146 (2006)
7. Lando, Y., Nutov, Z.: Inapproximability of survivable networks. Theoretical Computer Science 410, 2122-2125 (2009)
8. Menger, K.: Zur allgemeinen Kurventheorie. Fund. Mathematicae 10, 96-115 (1927)
9. Lovász, L., Neumann-Lara, V., Plummer, M.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica 9(4), 269-276 (1978)
10. Exoo, G.: On line disjoint paths of bounded length. Discrete Mathematics 44, 317-318 (1983)
11. Niepel, L., Safarikova, D.: On a generalization of Menger's theorem. Acta Mathematica Universitatis Comenianae 42, 275-284 (1983)
12. Ben-Ameur, W.: Constrained length connectivity and survivable networks. Networks 36, 17-33 (2000)
13. Pyber, L., Tuza, Z.: Menger-type theorems with restrictions on path lengths. Discrete Mathematics 120, 161-174 (1993)
14. Baier, G.: Flows with path restrictions. PhD thesis, Technische Universität Berlin (2003)
15. Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Operations Research Proceedings 2005, pp. 297-302 (2006)
16. Mahjoub, A., McCormick, T.: Max flow and min cut with bounded-length paths: Complexity, algorithms and approximation. Mathematical Programming (to appear)
17. Baier, G., Erlebach, T., Hall, A., Köhler, E., Kolman, P., Panagrác, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. ACM Transactions on Algorithms (to appear)
18. Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277-286 (1982) (Pubitemid 13491782)
19. Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Computational Complexity 12, 131-149 (2003)
20. Perl, Y., Ronen, D.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14 (1984)
21. Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1), 135-150 (1995)
22. Botton, Q., Fortz, B., Gouveia, L.: The k-edge 3-hop constrained network design polyhedron. In: Proceedings of the 9th INFORMS Telecommunications Conference, Available as preprint at Université Catholique de Louvain: Le polyedre du probleme de conception de reseaux robustes K-arête connexe avec 3 sauts (2008)
23. Dahl, G., Huygens, D., Mahjoub, A., Pesneau, P.: On the k edge-disjoint 2-hop-constrained paths polytope. Operations Research Letters 34, 577-582 (2006)
24. Huygens, D., Mahjoub, A.: Integer programming formulations for the two 4-hop constrained paths problem. Networks 49(2), 135-144 (2007) (Pubitemid 46931770)
25. Golovach, P., Thilikos, D.: Paths of bounded length and their cuts: Parameterized complexity and algorithms. In: Chen, J., Fomin, F. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 210-221. Springer, Heidelberg (2009)
26. Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC '99), pp. 19-28 (1999)
27. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (1999)
28. Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. Journal of Research of the National Bureau of Standards 69B, 125-130 (1965)
29. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)