Abstract
We design exact algorithms for the following two problems in survivable network design: (i) designing a minimum cost network with a desired value of edge connectivity, which is called Minimum Weight \(\lambda \) -connected Spanning Subgraph and (ii) augmenting a given network to a desired value of edge connectivity at a minimum cost which is called Minimum Weight \(\lambda \) -connectivity Augmentation. It is easy to see that a minimum solution to these problems contains at most \(2 \lambda (n-1)\) edges. Using this fact one can design a brute-force algorithm which runs in time \(2^{{\mathcal {O}}(\lambda n \log n)}\), however no better algorithms were known previously. In this paper, we give the first single exponential time algorithm for these problems, i.e. running in time \(2^{{\mathcal {O}}(\lambda n)}\), for both undirected and directed networks. Our results are obtained via well known characterizations of \(\lambda \)-connected graphs, their connections to linear matroids and the recently developed technique of dynamic programming with representative sets.
Notes
We slightly abuse notation for the sake of clarity, as strictly speaking X and \(\textsf {Out}_{D^r_G}(v)\) are disjoint, since they are subsets of two different copies of the arc set.
References
Bang-Jensen, J., Gutin, G.Z.: Digraphs: theory, algorithms and applications. Springer Science & Business Media, Berlin (2008)
Basavaraju, M., Fomin, F.V., Golovach, P., Misra, P., Ramanujan, M., Saurabh, S.: Parameterized algorithms to preserve connectivity. In: Automata, Languages, and Programming, pp. 800–811. Springer (2014)
Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61–63 (1962)
Berman, P., Dasgupta, B., Karpinski, M.: Approximating transitive reductions for directed networks. In: Proceedings of the 11th International Symposium on Algorithms and Data Structures. pp. 74–85. Springer-Verlag (2009)
Bjorklund, A.: Determinant sums for undirected hamiltonicity. SIAM J. Comput. 43(1), 280–299 (2014)
Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via matching. SIAM J. Comput. 30(2), 528–560 (2000)
Cygan, M., Fomin, F.V., Golovnev, A., Kulikov, A.S., Mihajlin, I., Pachocki, J., Socala, A.: Tight bounds for graph homomorphism and subgraph isomorphism. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. pp. 1643–1649 (2016)
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)
Cygan, M., Kratsch, S., Nederlof, J.: Fast hamiltonicity checking via bases of perfect matchings. In: Proceedings of the forty-fifth annual ACM Symposium on Theory of Computing. pp. 301–310. ACM (2013)
Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1–29:60 (Sep 2016), http://doi.acm.org/10.1145/2886094
Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 25–53 (1992)
Frank, H., Chou, W.: Connectivity considerations in the design of survivable networks. Circuit Theory, IEEE Transactions on 17(4), 486–D490 (1970)
Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259–273 (1995)
Gusfield, D.: A graph theoretic approach to statistical data security. SIAM J. Comput. 17(3), 552–571 (1988)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196–210 (1962)
Jain, S., Gopal, K.: On network augmentation. Reliab. IEEE Trans. 35(5), 541–543 (1986)
Kao, M.Y.: Data security equals graph connectivity. SIAM J. Discrete Math. 9(1), 87–100 (1996)
Khuller, S.: Approximation algorithms for finding highly connected subgraphs. Vertex 2, 2 (1997)
Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM (JACM) 41(2), 214–235 (1994)
Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2010)
Marx, D.: A parameterized view on matroid optimization problems. Theor. Comput. Sci. 410(44), 4471–4479 (2009), http://dx.doi.org/10.1016/j.tcs.2009.07.027
Marx, D., Végh, L.A.: Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. ACM Trans. Algorithms (TALG) 11(4), 27 (2015)
Moyles, D.M., Thompson, G.L.: An algorithm for finding a minimum equivalent graph of a digraph. J. ACM (JACM) 16(3), 455–460 (1969)
Oxley, J.G.: Matroid Theory, vol. 3. Oxford University Press, USA (2006)
Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Springer Science & Business Media, Berlin (2003)
Watanabe, T., Narita, T., Nakamura, A.: 3-edge-connectivity augmentation problems. In: Circuits and Systems, 1989., IEEE International Symposium on. pp. 335–338. IEEE (1989)
Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: ACM symposium on Theory of computing. pp. 887–898 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version of this article appeared at WADS 2017.
Rights and permissions
About this article
Cite this article
Agrawal, A., Misra, P., Panolan, F. et al. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84, 2622–2641 (2022). https://doi.org/10.1007/s00453-022-00959-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-00959-3