Opening book details…
About this Computer Science article
On the Parameterized Complexity of Approximating Dominating Set by S., Karthik C.; Laekhanukit, Bundit; Manurangsi, Pasin is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- S., Karthik C.; Laekhanukit, Bundit; Manurangsi, Pasin
- Publisher
- Association for Computing Machinery; Association for Computing Machinery (ACM) (ISSN 0004-5411)
- Published
- 2019
- Field
- Computer Science (Physical Sciences)
More by S., Karthik C.; Laekhanukit, Bundit; Manurangsi, Pasin
Browse all works by S., Karthik C.; Laekhanukit, Bundit; Manurangsi, Pasin