Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
In this paper, we consider the maximum and minimum versions of degree-concentrated fault-tolerant spanning subgraph problem which has many applications in network communications. We prove that both this two problems are NP-hard. For the maximum version, we use DC programming relaxation to propose a heuristic algorithm. Numerical tests indicate that the proposed algorithm is efficient and effective. For the minimum version, we also formulate it as a DC program, and show that the DC algorithm does not perform well for this problem.
KeywordsFault-tolerant Connectivity DC programming Convex function
Mathematics Subject Classification90C27 90C26
The first author was partially supported by NSFC (No. 11501412). The fourth author was partially supported by the Paul and Heidi Brown Preeminent Professorship at ISE, University of Florida. The fifth author was partially supported by NSFC (No. 11531014). The sixth author was partially supported by NSFC (Nos. 61222201 and 11531011).
- 2.Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., Rudolf, G.: Generating minimal \(k\)-vertex connected spanning subgraphs. In: Proceedings of the 13th International Computing and Combinatorics Conference, pp. 222–231 (2007)Google Scholar
- 4.Chakraborty, T., Chuzhoy, J., Khanna, S.: Network design for vertex connectivity. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 167–176 (2008)Google Scholar
- 5.Cornaz, D., Magnouche, Y.: On minimal two-edge-connected graphs. In: Proceedings of 2014 International Conference on Control, Decision and Information Technologies, pp. 251–256 (2014)Google Scholar
- 6.Coulbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)Google Scholar
- 11.Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 236–265. PWS Publishing Company, Boston, MA (1997)Google Scholar
- 12.Kobayashi, Y.: The complexity of maximizing the difference of two matorid rank functions. METR2014-42, University of Tokyo (2014)Google Scholar
- 13.Kortsarz, G., Nutov, Z.: Chapter 58: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook on Approximation Algorithms and Metaheuristics. Chapman Hall, Santa Barbara (2007)Google Scholar
- 21.Maehara, T., Marumo, N., Murota, K.: Continuous relaxation for discrete DC programming. In: Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 181–190 (2015)Google Scholar
- 24.Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems: methods of subgradients. In: Hiriart-Urruty, J.B. (ed.) Fermat Days 85: Mathematics for Optimization, North-Holland Mathematics Studies, vol. 129, pp. 249–271. North-Holland, Amsterdam (1986)CrossRefGoogle Scholar
- 31.Xu, J.M.: Combinatorial Theory in Networks. Academic Press, Cambridge (2013)Google Scholar