Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IPL

2008

2008

A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a dominating set of size at most g(k), where g(k) is some fixed function of k. Such an outcome is termed an FPT approximation algorithm. We describe some results that begin to provide some answers. We show that there is no such FPT algorithm for g(k) of the form k + c (where c is a fixed constant, termed an additive FPT approximation), unless FPT = W [2]. We answer the analogous problem completely for the related Independent Dominating Set (IDS) problem, showing that IDS does not admit an FPT approximation algorithm, for any g(k), unless FPT = W [2].

Related Content

Added |
12 Dec 2010 |

Updated |
12 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
IPL |

Authors |
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond |

Comments (0)