The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits

DOI10.1007/978-3-030-18126-0_12OpenAlexW2938739939MaRDI QIDQ2327096

Wenxing Lai

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-18126-0_12

zbMATH Keywords

dominating setinapproximabilityparameterized \(\mathsf{{AC}^0}\)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem

This page was built for publication: The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits