Bicriteria Network Design via Iterative Rounding

We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for this problem, by extending a linear programming based technique of iterative rounding. Previously, a (4, 4)-approximation algorithm for this problem was known. The running time of this previous algorithm is not strongly polynomial.

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Piotr Krysta
• Keywords: COCOON 2005, Linear Budget Constraint, Network Design Problem, Strongly Polynomial