A Truthful (2-2/::::k::::)-Approximation Mechanism for the Steiner Tree Problem with ::::k:::: Terminals

Luciano GualĂ , Guido Proietti. A Truthful (2-2/::::k::::)-Approximation Mechanism for the Steiner Tree Problem with ::::k:::: Terminals. In Lusheng Wang, editor, Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings. Volume 3595 of Lecture Notes in Computer Science, pages 390-400, Springer, 2005. [doi]

@inproceedings{GualaP05:0,
  title = {A Truthful (2-2/::::k::::)-Approximation Mechanism for the Steiner Tree Problem with ::::k:::: Terminals},
  author = {Luciano GualĂ  and Guido Proietti},
  year = {2005},
  doi = {10.1007/11533719_40},
  url = {http://dx.doi.org/10.1007/11533719_40},
  researchr = {https://researchr.org/publication/GualaP05%3A0},
  cites = {0},
  citedby = {0},
  pages = {390-400},
  booktitle = {Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings},
  editor = {Lusheng Wang},
  volume = {3595},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-28061-8},
}