论文信息 - A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

We present a factor 2 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, which is also known as the survivable network design problem. Our algorithm first solves the linear relaxation of this problem, and then iteratively rounds off the solution. The key idea in rounding off is that in a basic solution of the LP relaxation, at least one edge gets included at least to the extent of half. We include this edge into our integral solution and solve the residual problem.

Kamal Jain

[1] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..

[2] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[3] Joseph Cheriyan,et al. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching , 1998, Electron. Colloquium Comput. Complex..

[4] David P. Williamson,et al. A primal-dual schema based approximation algorithm for the element connectivity problem , 2002, SODA '99.

[5] Vijay V. Vazirani,et al. On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.

[6] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

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

[8] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..