Parameterized approximation of dominating set problems

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 appr...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 109; no. 1; pp. 68 - 70
Main Authors:	Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.12.2008 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithms Computer science; control theory; systems Exact sciences and technology FPT approximation Information retrieval. Graph Mathematical problems Miscellaneous Parameterized complexity Studies Theoretical computing FPT approximation Approximation algorithms Parameterized complexity Approximation Dominating set Computer theory Information processing Independent set Approximation algorithm Algorithm analysis Graph algorithm Complexity
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!