MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem (0) [100 citations — 7 self]

by Kamal Jain
Combinatorica
Add To MetaCart

Abstract:

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. 1 Introduction We consider the problem of finding a minimum-cost subgraph of a given graph such that the number of edges crossing each cut is at least a specified requirement. Formally, given an undirected multigraph G = (V; E), a non-negative cost function c : E ! Q+ , and a requirement function f : 2 V ! Z , solve the following integer program (IP): min X e2E c e x...

Citations

246 A polynomial algorithm in linear programming. Doklady Akademiia Nauk SSSR – Khachiyan - 1979
245 A General Approximation Technique for Constrained Forest Problems – Goemans, Williamson - 1995
163 Multi-terminal network flows – Gomory, Hu - 1961
103 A new algorithm for minimizing convex functions over convex sets – Vaidya - 1996
80 Vertex packings: structural properties and algorithms – Nemhauser, Trotter - 1975
76 A strongly polynomial algorithm for solving combinatorial linear programs – Tardos - 1986
67 A primal-dual approximation algorithm for generalized steiner network problems – Williamson, Goemans, et al.
50 Improved approximation algorithms for network design problems – Goemans, Goldberg, et al. - 1994
2 Approximation algorithms for multiway cuts in node-weighted and directed graphs – Garg, Vazirani, et al. - 1994