Improved algorithm for degree bounded survivable network design problem

Authors:
Anand Louis;Nisheeth K. Vishnoi
Affiliations:
College of Computing, Georgia Tech., Atlanta;Microsoft Research India, Bangalore
Venue:
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Year:
2010

Citing 16
Cited 2

Survivable networks, linear programming relaxations and the parsimonious property

Mathematical Programming: Series A and B
Approximating the minimum-degree Steiner tree to within one of optimal

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms

Approximation algorithms
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Algorithms for a network design problem with crossing supermodular demands

Networks
Approximation algorithms for finding low-degree subgraphs

Networks
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Journal of Computer and System Sciences - Special issue on FOCS 2001
Minimum Bounded Degree Spanning Trees

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Survivable network design with degree or order constraints

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Additive approximation for bounded degree survivable network design

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Degree Bounded Network Design with Metric Costs

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs

Algorithmica
Degree bounded matroids and submodular flows

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

Network-design with degree constraints

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On some network design problems with degree constraints

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the degree of a degree constrained vertex v is at most 2 b(v)+2. This improves upon the results of Lau and Singh [13] and Lau, Naor, Salavatipour and Singh [12].