Abstract
A path is said to be ℓ-bounded if it contains at most ℓ edges. We consider two types of ℓ-bounded disjoint paths problems. In the maximum edge- or node-disjoint path problems MEDP(ℓ) and MNDP(ℓ), the task is to find the maximum number of edge- or node-disjoint ℓ-bounded (s,t)-paths in a given graph G with source s and sink t, respectively. In the weighted edge- or node-disjoint path problems WEDP(ℓ) and WNDP(ℓ), we are also given an integer k ∈ ℕ and non-negative edge weights c e ∈ ℕ, e ∈ E, and seek for a minimum weight subgraph of G that contains k edge- or node-disjoint ℓ-bounded (s,t)-paths. Both problems are of great practical relevance in the planning of fault-tolerant communication networks, for example.
Even though length-bounded cut and flow problems have been studied intensively in the last decades, the \(\mathcal{NP}\)-hardness of some 3- and 4-bounded disjoint paths problems was still open. In this paper, we settle the complexity status of all open cases showing that WNDP(3) can be solved in polynomial time, that MEDP(4) is \(\mathcal{AP\kern-1.5ptX}\)-complete and approximable within a factor of 2, and that WNDP(4) and WEDP(4) are \(\mathcal{AP\kern-1.5ptX}\)-hard and \(\mathcal{NPO}\)-complete, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
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)
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)
Chekuri, C., Khanna, S., Shepherd, F.: An \(\mathcal{O}(\sqrt{n})\) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing 2, 137–146 (2006)
Lando, Y., Nutov, Z.: Inapproximability of survivable networks. Theoretical Computer Science 410, 2122–2125 (2009)
Menger, K.: Zur allgemeinen Kurventheorie. Fund. Mathematicae 10, 96–115 (1927)
Lovász, L., Neumann-Lara, V., Plummer, M.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica 9(4), 269–276 (1978)
Exoo, G.: On line disjoint paths of bounded length. Discrete Mathematics 44, 317–318 (1983)
Niepel, L., Safarikova, D.: On a generalization of Menger’s theorem. Acta Mathematica Universitatis Comenianae 42, 275–284 (1983)
Ben-Ameur, W.: Constrained length connectivity and survivable networks. Networks 36, 17–33 (2000)
Pyber, L., Tuza, Z.: Menger-type theorems with restrictions on path lengths. Discrete Mathematics 120, 161–174 (1993)
Baier, G.: Flows with path restrictions. PhD thesis, Technische Universität Berlin (2003)
Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Operations Research Proceedings 2005, pp. 297–302 (2006)
Mahjoub, A., McCormick, T.: Max flow and min cut with bounded-length paths: Complexity, algorithms and approximation. Mathematical Programming (to appear)
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)
Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277–286 (1982)
Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Computational Complexity 12, 131–149 (2003)
Perl, Y., Ronen, D.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14 (1984)
Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1), 135–150 (1995)
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)
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)
Huygens, D., Mahjoub, A.: Integer programming formulations for the two 4-hop constrained paths problem. Networks 49(2), 135–144 (2007)
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)
Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Near-optimal 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)
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)
Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. Journal of Research of the National Bureau of Standards 69B, 125–130 (1965)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bley, A., Neto, J. (2010). Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)