Approximation Hardness of Dominating Set Problems

Miroslav Chlebík, Janka Chlebíková. Approximation Hardness of Dominating Set Problems. In Susanne Albers, Tomasz Radzik, editors, Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Volume 3221 of Lecture Notes in Computer Science, pages 192-203, Springer, 2004. [doi]

@inproceedings{ChlebikC04:2,
  title = {Approximation Hardness of Dominating Set Problems},
  author = {Miroslav Chlebík and Janka Chlebíková},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3221&spage=192},
  researchr = {https://researchr.org/publication/ChlebikC04%3A2},
  cites = {0},
  citedby = {0},
  pages = {192-203},
  booktitle = {Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings},
  editor = {Susanne Albers and Tomasz Radzik},
  volume = {3221},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-23025-4},
}