A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang. A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. J. Algorithms, 36(2):182-204, 2000.

@article{WuCT00:0,
  title = {A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees},
  author = {Bang Ye Wu and Kun-Mao Chao and Chuan Yi Tang},
  year = {2000},
  researchr = {https://researchr.org/publication/WuCT00%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {36},
  number = {2},
  pages = {182-204},
}