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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 109; číslo 1; s. 68 - 70
Hlavní autoři:	Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.12.2008 Elsevier Elsevier Sequoia S.A
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!