A nearly best-possible approximation algorithm for node-weighted Steiner trees

Philip N. Klein, R. Ravi. A nearly best-possible approximation algorithm for node-weighted Steiner trees. In Giovanni Rinaldi, Laurence A. Wolsey, editors, Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. pages 323-332, CIACO, 1993.

@inproceedings{KleinR93a,
  title = {A nearly best-possible approximation algorithm for node-weighted Steiner trees},
  author = {Philip N. Klein and R. Ravi},
  year = {1993},
  researchr = {https://researchr.org/publication/KleinR93a},
  cites = {0},
  citedby = {0},
  pages = {323-332},
  booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993},
  editor = {Giovanni Rinaldi and Laurence A. Wolsey},
  publisher = {CIACO},
}