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. SIAM Journal on Computing, 31(6):1783-1793, 2002. [doi]

@article{KonemannR02,
  title = {A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees},
  author = {Jochen Könemann and R. Ravi},
  year = {2002},
  url = {http://epubs.siam.org/sam-bin/dbq/article/36917},
  researchr = {https://researchr.org/publication/KonemannR02},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {31},
  number = {6},
  pages = {1783-1793},
}