The Inapproximability of <i>k</i>-<span style="font-variant: small-caps">DominatingSet</span> for Parameterized <inline-formula> <mml:math id="mm841" display="block"> <mml:semantics> <mml:msup> <mml:mrow> <mml:mi mathvariant="sans-serif">AC</mml:mi> </mml:mrow> <mml:mn mathvariant="sans-serif">0</mml:mn> </mml:msup> </mml:semantics> </mml:math> </inline-formula> Circuits <xref rid="fn1-algorithms-565032" ref-type="fn">†</xref>

The Inapproximability of <i>k</i>-<span style="font-variant: small-caps">DominatingSet</span> for Parameterized <inline-formula> <mml:math id="mm841" display="block"> <mml:semantics> <mml:msup> <mml:mrow> <mml:mi mathvariant="sans-serif">AC</mml:mi> </mml:mrow> <mml:mn mathvariant="sans-serif">0</mml:mn> </mml:msup> </mml:semantics> </mml:math> </inline-formula> Circuits <xref rid="fn1-algorithms-565032" ref-type="fn">†</xref>

Chen and Flum showed that any FPT-approximation of the <i>k</i>-<span style="font-variant: small-caps;">Clique</span> problem is not in para-<inline-formula> <math display="inline"> <semantics> <msup> <mrow> <mi mathvariant...

Full description

Bibliographic Details
Main Author: Wenxing Lai
Format: Article
Language:English
Published: MDPI AG 2019-11-01
Series:Algorithms
Subjects:
parameterized <tt>ac</tt><sup>0</sup>
dominating set
inapproximability
Online Access:https://www.mdpi.com/1999-4893/12/11/230

Internet

https://www.mdpi.com/1999-4893/12/11/230

Similar Items