Abstract
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.
This project was supported by NSF grant CCF-1115849.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asadpour, A., Goemans, M.X., Madry, A., Oveis Gharan, S., Saberi, A.: An O(logn / loglogn)-approximation algrithm for the asymmetric traveling salesman problem. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2010)
Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Mathematical Programming, 1–28 (April 2012)
Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM Journal on Computing 39(4), 1413–1431 (2009)
Bauer, F., Varma, A.: Degree-constrained multicasting in point-to-point networks. In: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies, INFOCOM, pp. 369–376 (1995)
Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. Theoretical Computer Science 410, 4489–4503 (2009)
Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs. Algorithmica 55, 157–189 (2009)
Chekuri, C., Vondrák, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, FOCS, pp. 575–584 (2010)
Fürer, M., Raghavachari, B.: Approximating the minimum-degree Steiner Tree to within one of optimal. Journal of Algorithms 17(3), 409–423 (1994)
Goemans, M.X.: Minimum bounded degree spanning trees. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, FOCS, pp. 273–282 (2006)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner Network Problem. Combinatorica 21, 39–60 (2001)
Könemann, J., Ravi, R.: A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM Journal on Computing 31, 1783–1793 (2002)
Könemann, J., Ravi, R.: Primal-dual meets local search: approximating MST’s with nonuniform degree bounds. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC, pp. 389–395 (2003)
Oveis Gharan, S., Saberi, A.: The asymmetric traveling salesman problem on graphs with bounded genus. ArXiv (January 2011), http://arxiv.org/abs/0909.2849
Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31(1), 58–78 (2001)
Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer (2003)
Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC, pp. 661–670 (2007)
Zenklusen, R.: Matroidal degree-bounded minimum spanning trees. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1512–1521 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olver, N., Zenklusen, R. (2013). Chain-Constrained Spanning Trees. In: Goemans, M., Correa, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2013. Lecture Notes in Computer Science, vol 7801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36694-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-36694-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36693-2
Online ISBN: 978-3-642-36694-9
eBook Packages: Computer ScienceComputer Science (R0)