A primal-dual approximation algorithm for generalized steiner network problems

We present the first polynomial-time approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, also called the survivable network design problem. Ifk is the maximum cut requirement of the problem, our solution comes within a factor of 2k of optimal. Our algorithm is primal-dual and shows the importance of this technique in designing approximation algorithms.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[3]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[4]  Dorit S. Hochbaum,et al.  A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[5]  Charles U. Martel,et al.  A fast algorithm for optimally increasing the edge-connectivity , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[7]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[8]  Samir Khuller,et al.  Biconnectivity approximations and graph carvings , 1992, STOC '92.

[9]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[10]  A. Zelikovsky.  A faster 11/6-approximation algorithm for the Steiner tree problem in graphs , 1992 .

[11]  Vijay V. Vazirani,et al.  Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[13]  M. Stoer.  Design of Survivable Networks , 1993 .

[14]  R. Ravi,et al.  When cycles collapse: A general approximation technique for constrained two-connectivity problems , 1992, IPCO.

[15]  Andrew V. Goldberg,et al.  Improved approximation algorithms for network design problems , 1994, SODA '94.

[16]  S. Khuller,et al.  Biconnectivity approximations and graph carvings , 1994, JACM.

[17]  G. Dobson,et al.  Greedy Heuristics for Integer Programming with Non-negative Data , 2022 .