Prize-Collecting Survivable Network Design in Node-Weighted Graphs
We consider node-weighted network design problems, in particular the survivable network design problem (SNDP) and its prize-collecting version (PC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(st) for each pair of nodes st. The goal is to find a minimum node-weighted subgraph H of G such that, for each pair st, H contains r(st) edge-disjoint paths between s and t. PC-SNDP is a generalization in which the input also includes a penalty π(st) for each pair, and the goal is to find a subgraph H to minimize the sum of the weight of H and the sum of the penalties for all pairs whose connectivity requirements are not fully satisfied by H. Let k = max st r(st) be the maximum requirement. There has been no non-trivial approximation for node-weighted PC-SNDP for k > 1, the main reason being the lack of an LP relaxation based approach for node-weighted SNDP. In this paper we describe multiroute-flow based relaxations for the two problems and obtain approximation algorithms for PC-SNDP through them. The approximation ratios we obtain for PC-SNDP are similar to those that were previously known for SNDP via combinatorial algorithms. Specifically, we obtain an O(k 2 logn)-approximation in general graphs and an O(k 2)-approximation in graphs that exclude a fixed minor. The approximation ratios can be improved by a factor of k but the running times of the algorithms depend polynomially on n k .
Unable to display preview. Download preview PDF.
- 3.Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. of ACM-SIAM SODA, pp. 106–115 (2000)Google Scholar
- 6.Chudak, F.A., Nagano, K.: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. In: Proc. of ACM-SIAM SODA, pp. 79–88 (2007)Google Scholar
- 7.Chuzhoy, J., Khanna, S.: An O(k 3 logn)-approximation algorithm for vertex-connectivity survivable network design. In: Proc. of IEEE FOCS, pp. 437–441 (2009)Google Scholar
- 9.Guha, S., Moss, A., Naor, J.S., Schieber, B.: Efficient recovery from power outage. In: Proc. of ACM STOC, pp. 574–582 (1999)Google Scholar
- 11.Hajiaghayi, M.T., Jain, K.: The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. In: Proc. of ACM-SIAM SODA, pp. 631–640 (2006)Google Scholar
- 15.Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proc. of ACM-SIAM SODA, pp. 760–769 (2000)Google Scholar
- 19.Nutov, Z.: Approximating Steiner networks with node-weights. SIAM Journal of Computing 39(7), 3001–3022 (2010); Preliminary version in Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.): LATIN 2008. LNCS, vol. 4957. Springer, Heidelberg (2008)Google Scholar
- 20.Sharma, Y., Swamy, C., Williamson, D.P.: Approximation algorithms for prize collecting forest problems with submodular penalty functions. In: Proc. of ACM-SIAM SODA, pp. 1275–1284 (2007)Google Scholar