Skip to main content
SpringerLink
Log in

Degree-Bounded Trees

1994; Fürer, Raghavachari

  • Reference work entry
Encyclopedia of Algorithms

  • 284 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Chan, T.M.: Euclidean bounded‐degree spanning tree ratios. Discret. Comput. Geom. 32(2), 177–194 (2004)

    Article  MATH  Google Scholar 

  2. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A push-relabel algorithm for approximating degree bounded MSTs. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), Part I. LNCS, vol. 4051, pp. 191–201. Springer, Berlin (2006)

    Google Scholar 

  3. Chvátal, V.: Tough graphs and Hamiltonian circuits. Discret. Math. 5, 215–228 (1973)

    Article  MATH  Google Scholar 

  4. Fekete, S.P., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.: A network-flow technique for finding low‐weightbounded‐degree spanning trees. In: Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference (IPCO 1996) and J. Algorithms 24(2), 310–324 (1997)

    Google Scholar 

  5. Fischer, T.: Optimizing the degree of minimum weight spanning trees, Technical Report TR93–1338. Cornell University, Computer Science Department (1993)

    Google Scholar 

  6. Fürer, M., Raghavachari, B.: An NC approximation algorithm for the minimum‐degree spanning tree problem. In: Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing, 1990, pp. 174–281

    Google Scholar 

  7. Fürer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), 1992, pp. 317–324

    Google Scholar 

  8. Fürer, M., Raghavachari, B.: Approximating the minimum‐degree Steiner tree to within one of optimal. J. Algorithms 17(3), 409–423 (1994)

    Article  MathSciNet  Google Scholar 

  9. Goemans, M.X.: Minimum bounded degree spanning trees. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006, pp. 273–282

    Google Scholar 

  10. Khuller, S., Raghavachari, B., Young, N.: Low-degree spanning trees of small weight. SIAM J. Comput. 25(2), 355–368 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Klein, P.N., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation algorithms for finding low-degree subgraphs. Networks 44(3), 203–215 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Könemann, J., Ravi, R.: A matter of degree: Improved approximation algorithms for degree‐bounded minimum spanning trees. SIAM J. Comput. 31(6), 1783–1793 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Könemann, J., Ravi, R.: Primal-dual meets local search: Approximating MSTs with nonuniform degree bounds. SIAM J. Comput. 34(3), 763–773 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Raghavachari, B.: Algorithms for finding low degree structures. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. pp. 266–295. PWS Publishing Company, Boston (1995)

    Google Scholar 

  15. Ravi, R., Singh, M.: Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006) Part I. LNCS, vol. 4051, pp. 169–180. Springer, Berlin (2006)

    Google Scholar 

  16. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the thirty-ninth Annual ACM Symposium on Theory of Computing (STOC 2007), New York, NY, 2007, pp. 661–670

    Google Scholar 

  17. Win, S.: On a connection between the existence of k-trees and the toughness of a graph. Graphs Comb. 5(1), 201–205 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA

    Martin Fürer

Authors
  1. Martin Fürer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Fürer, M. (2008). Degree-Bounded Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_104

Download citation

Publish with us

Policies and ethics

Search

Navigation