Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Proceedings of the fifth international workshop on Foundations of mobile 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
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Network Design with Weighted Degree Constraints
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
End System Multicast routing for multi-party videoconferencing applications
Computer Communications
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A push-relabel algorithm for approximating degree bounded MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Network design with weighted degree constraints
Discrete Optimization
Chain-Constrained spanning trees
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we present a new bicriteria approximation algorithm for the degree-bounded minimum spanning tree problem. In this problem, we are given an undirected graph, a nonnegative cost function on the edges, and a positive integer B*, and the goal is to find a minimum-cost spanning tree T with maximum degree at most B*. In an n-node graph, our algorithm finds a spanning tree with maximum degree O(B*+logn) and cost O(optB*), where optB* is the minimum cost of any spanning tree whose maximum degree is at most B*. Our algorithm uses ideas from Lagrangean duality. We show how a set of optimum Lagrangean multipliers yields bounds on both the degree and the cost of the computed solution.