Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Steiner trees and beyond: approximation algorithms for network design
Steiner trees and beyond: approximation algorithms for network design
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
SIAM Journal on Computing
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Spanning trees with minimum weighted degrees
Information Processing Letters
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Survivable Network Design with Degree or Order Constraints
SIAM Journal on Computing
Degree bounded matroids and submodular flows
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
In an undirected graph G=(V,E) with a weight function w:ExV-Q"+, the weighted degree d"w(v;E) of a vertex v is defined as @?{w(e,v)|e@?Eincident tov}. In this paper, we consider a network design problem which has upper-bounds on weighted degrees of vertices as its constraints while the objective is to compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem of minimizing the maximum weighted degree of vertices is also discussed.