We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible. Iterative rounding became the tool of choice for constrained spanning tree problems. However, iterative rounding approaches are very hard to adapt to settings where an edge can be part of a super-constant number of constraints. We consider a natural constrained spanning tree problem of this type, namely where upper bounds are imposed on a family of cuts forming a chain. Our approach reduces the problem to a family of independent matroid intersection problems, leading to a spanning tree that violates each constraint by a factor of at most 9. We also present strong hardness results: among other implications, these are the first to show, in the setting of a basic constrained spanning tree problem, a qualitative difference between what can be achieved when allowing multiplicative as opposed to additive constraint violations. © 2013 Springer-Verlag.
|Journal||Lecture Notes in Computer Science|
|Publication status||Published - 2013|
|Event||Integer Programming and Combinatorial Optimization - Berlin Heidelberg|
Duration: 18 Mar 2013 → 20 Mar 2013
Bibliographical noteProceedings title: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization
Place of publication: Berlin Heidelberg
Editors: J. Correa, M. Goemans