Universal approximations for TSP, Steiner tree, and set cover

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram. Universal approximations for TSP, Steiner tree, and set cover. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 386-395, ACM, 2005. [doi]

@inproceedings{JiaLNRS05,
  title = {Universal approximations for TSP, Steiner tree, and set cover},
  author = {Lujun Jia and Guolong Lin and Guevara Noubir and Rajmohan Rajaraman and Ravi Sundaram},
  year = {2005},
  doi = {10.1145/1060590.1060649},
  url = {http://doi.acm.org/10.1145/1060590.1060649},
  researchr = {https://researchr.org/publication/JiaLNRS05},
  cites = {0},
  citedby = {0},
  pages = {386-395},
  booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005},
  editor = {Harold N. Gabow and Ronald Fagin},
  publisher = {ACM},
  isbn = {1-58113-960-8},
}