On the parameterized complexity of approximating dominating set

Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi. On the parameterized complexity of approximating dominating set. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 1283-1296, ACM, 2018. [doi]

Abstract

Abstract is missing.