Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Algorithms for finding low degree structures
Approximation algorithms for NP-hard problems
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Degree-constrained multicasting in point-to-point networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
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
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
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Chain-Constrained spanning trees
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-bounded MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for degree-constrained network design problems. A cornerstone for this development was the work of Singh and Lau [19], who showed that for the degree-bounded MST problem, one can find a spanning tree violating each degree bound by at most one unit and with cost at most the cost of an optimal solution that respects the degree bounds. However, current iterative rounding approaches face several limits when dealing with more general degree constraints, where several linear constraints are imposed on the edges adjacent to a vertex v. For example, when a partition of the edges adjacent to v is given and only a fixed number of elements can be chosen out of each set of the partition, current approaches might violate each of the constraints at v by a constant, instead of violating the whole family of constraints at v by at most a constant number of edges. Furthermore, previous iterative rounding approaches are not suited for degree constraints where some edges are in a super-constant number of constraints. We extend iterative rounding/relaxation approaches, both conceptually as well as in their analysis, to address these limitations. Based on these extensions, we present an algorithm for the degree-constrained MST problem where for every vertex v, the edges adjacent to v have to be independent in a given matroid. The algorithm returns a spanning tree of cost at most OPT, such that for every vertex v, it suffices to remove at most 8 edges from the spanning tree to satisfy the matroidal degree constraint at v.