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
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth 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
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
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
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
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Network Design with Weighted Degree Constraints
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Approximating Scheduling Machines with Capacity Constraints
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Degree bounded matroids and submodular flows
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Multi-objective problems in terms of relational algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Topology control for future airborne networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
k-edge-connectivity: approximation and LP relaxation
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Approximating minimum cost source location problems with local vertex-connectivity demands
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Iterative packing for demand and hypergraph matching
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
The Journal of Machine Learning Research
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
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Hypergraphic LP relaxations for steiner trees
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Network design with weighted degree constraints
Discrete Optimization
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
Survey A survey of peer-to-peer live video streaming schemes - An algorithmic perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
On some network design problems with degree constraints
Journal of Computer and System Sciences
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 the Minimum Bounded Degree Spanning Tree problem, we aregiven an undirected graph with a degree upper bound Bv on eachvertex v, and the task is to find a spanning tree of minimumcost which satisfies all the degree bounds. Let OPT be the costof an optimal solution to this problem. In this paper, we presenta polynomial time algorithm which returns a spanning tree T ofcost at most OPT and dT(v) ≤ Bv+1 for all v, where dT(v) denotes the degree of v in T. This generalizes aresult of Furer and Raghavachari [8] to weighted graphs, andsettles a 15-year-old conjecture of Goemans [10] affirmatively. The algorithm generalizes when each vertex v hasa degree lower bound Av and a degree upper bound Bv, andreturns a spanning tree with cost at most OPT and Av - 1 ≤dT(v) ≤ Bv + 1 for all v. This is essentially the bestpossible. The main technique used is an extension of the iterativerounding method introduced by Jain [12] for the design ofapproximation algorithms.