Improved approximation bounds for edge dominating set in dense graphs

Jean Cardinal, Stefan Langerman, Eythan Levy. Improved approximation bounds for edge dominating set in dense graphs. Theoretical Computer Science, 410(8-10):949-957, 2009. [doi]

@article{CardinalLL09,
  title = {Improved approximation bounds for edge dominating set in dense graphs},
  author = {Jean Cardinal and Stefan Langerman and Eythan Levy},
  year = {2009},
  doi = {10.1016/j.tcs.2008.12.036},
  url = {http://dx.doi.org/10.1016/j.tcs.2008.12.036},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CardinalLL09},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {410},
  number = {8-10},
  pages = {949-957},
}