On the Parameterized Complexity of Approximating Dominating Set

Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi. On the Parameterized Complexity of Approximating Dominating Set. Electronic Colloquium on Computational Complexity (ECCC), 24:186, 2017. [doi]

@article{SLM17,
  title = {On the Parameterized Complexity of Approximating Dominating Set},
  author = {Karthik C. S. and Bundit Laekhanukit and Pasin Manurangsi},
  year = {2017},
  url = {https://eccc.weizmann.ac.il/report/2017/186},
  researchr = {https://researchr.org/publication/SLM17},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {24},
  pages = {186},
}