Advertisement

Chain-Constrained Spanning Trees

  • Neil Olver
  • Rico Zenklusen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7801)

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.

Keywords

Span Tree Span Tree Problem Good Edge Degree Constraint Iterative Rounding 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM Journal on Computing 39(4), 1413–1431 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Fürer, M., Raghavachari, B.: Approximating the minimum-degree Steiner Tree to within one of optimal. Journal of Algorithms 17(3), 409–423 (1994)MathSciNetCrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Jain, K.: A factor 2 approximation algorithm for the generalized Steiner Network Problem. Combinatorica 21, 39–60 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Oveis Gharan, S., Saberi, A.: The asymmetric traveling salesman problem on graphs with bounded genus. ArXiv (January 2011), http://arxiv.org/abs/0909.2849
  14. 14.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer (2003)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Neil Olver
    • 1
  • Rico Zenklusen
    • 2
  1. 1.MITCambridgeUSA
  2. 2.Johns Hopkins UniversityBaltimoreUSA

Personalised recommendations