On the chance-constrained minimum spanning k-core problem
- 80 Downloads
A graph is called a k-core if every vertex has at least k neighbors. If the parameter k is sufficiently large relative to the number of vertices, a k-core is guaranteed to possess 2-hop reachability between all pairs of vertices. Furthermore, it is guaranteed to preserve those pairwise distances under arbitrary single-vertex deletion. Hence, the concept of a k-core can be used to produce 2-hop survivable network designs, specifically to design inter-hub networks. Formally, given an edge-weighted graph, the minimum spanningk-core problem seeks a spanning subgraph of the given graph that is a k-core with minimum total edge weight. For any fixed k, this problem is equivalent to a generalized graph matching problem and can be solved in polynomial time. This article focuses on a chance-constrained version of the minimum spanning k-core problem under probabilistic edge failures. We first show that this probabilistic version is NP-hard, and we conduct a polyhedral study to strengthen the formulation. The quality of bounds produced by the strengthened formulation is demonstrated through a computational study.
KeywordsChance-constrained optimization Minimum spanning k-core Hop-constrained survivable network design
The computational experiments reported in this article were conducted at the Oklahoma State University High Performance Computing Center. The authors would also like to thank Foad Mahdavi Pajouh for helpful discussions regarding the complexity and lifting results.
- 4.Balasundaram, B.: Graph theoretic generalizations of clique: Optimization and extensions. Ph.D. thesis, Texas A&M University, College Station, Texas, USA (2007)Google Scholar
- 10.Dave, D.B.: Patterns of freight flow and design of a less-than-truckload distribution network. Ph.D. thesis, Georgia Institute of Technology (2004)Google Scholar
- 17.Liu, X., Kılınç-Karzan, F., Küçükyavuz, S.: On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Program. (2018). https://doi.org/10.1007/s10107-018-1231-2
- 18.Luedtke, J.: An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand, F., Shepherd, F. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 6080, pp. 271–284. Springer, Berlin (2010)CrossRefGoogle Scholar
- 21.Ma, J., Balasundaram, B.: Solving chance-constrained spanning \(k\)-core problem via decomposition and integer programming. In: Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC 2013), pp. 2774–2783. Institute of Industrial Engineers, Norcross, GA (2013)Google Scholar
- 35.Veremyev, A., Boginski, V.: Robustness and strong attack tolerance of low-diameter networks. In: Sorokin, A., Murphey, R., Thai, M.T., Pardalos, P.M. (eds.) Dynamics of Information Systems: Mathematical Foundations, Springer Proceedings in Mathematics & Statistics, vol. 20, pp. 137–156. Springer, New York (2012)Google Scholar