English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Parameterized Complexity of Approximating Dominating Set

MPS-Authors
/persons/resource/persons180826

Laekhanukit,  Bundit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Karthik, C. S., Laekhanukit, B., & Manurangsi, P. (2018). On the Parameterized Complexity of Approximating Dominating Set. In STOC'18 (pp. 1283-1296). New York, NY: ACM. doi:10.1145/3188745.3188896.


Cite as: http://hdl.handle.net/21.11116/0000-0002-A81D-1
Abstract
There is no abstract available