Bicriteria network design via iterative rounding

Authors:
Piotr Krysta
Affiliations:
Department of Computer Science, Dortmund University, Dortmund, Germany
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 10
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Using separation algorithms in fixed dimension

Journal of Algorithms
Many birds with one stone: multi-objective approximation algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Bicriteria network design problems

Journal of Algorithms
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
The Multi-Weighted Spanning Tree Problem (Extended Abstract)

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.