A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

Jochen Könemann, R. Ravi. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In STOC. pages 537-546, 2000. [doi]

@inproceedings{KonemannR00,
  title = {A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees},
  author = {Jochen Könemann and R. Ravi},
  year = {2000},
  doi = {10.1145/335305.335371},
  url = {http://doi.acm.org/10.1145/335305.335371},
  researchr = {https://researchr.org/publication/KonemannR00},
  cites = {0},
  citedby = {0},
  pages = {537-546},
  booktitle = {STOC},
}