Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs

Mirela Damian-Iordache, Sriram V. Pemmaraju. Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. In Alok Aggarwal, C. Pandu Rangan, editors, Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings. Volume 1741 of Lecture Notes in Computer Science, pages 70-82, Springer, 1999. [doi]

@inproceedings{Damian-IordacheP99a,
  title = {Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs},
  author = {Mirela Damian-Iordache and Sriram V. Pemmaraju},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1741/17410070.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Damian-IordacheP99a},
  cites = {0},
  citedby = {0},
  pages = {70-82},
  booktitle = {Algorithms and Computation, 10th International Symposium, ISAAC  99, Chennai, India, December 16-18, 1999, Proceedings},
  editor = {Alok Aggarwal and C. Pandu Rangan},
  volume = {1741},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66916-7},
}