A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang. A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. In SODA. pages 21-32, 1998.

@inproceedings{WuLBCRT98,
  title = {A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees},
  author = {Bang Ye Wu and Giuseppe Lancia and Vineet Bafna and Kun-Mao Chao and R. Ravi and Chuan Yi Tang},
  year = {1998},
  tags = {routing},
  researchr = {https://researchr.org/publication/WuLBCRT98},
  cites = {0},
  citedby = {0},
  pages = {21-32},
  booktitle = {SODA},
}