A fixed-parameter tractable algorithm for matrix domination

Matrix domination is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same column as all other non-zero entries. Using a kernelization and search tree approach, we show the problem to be fixed-parameter tractable wit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 90; číslo 5; s. 267 - 272
Hlavní autor: Weston, Mark
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 15.06.2004
Elsevier Science
Elsevier Sequoia S.A
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis of algorithms
Applied sciences
Computational complexity
Computer science; control theory; systems
Decision trees
Exact sciences and technology
Graph algorithms
Mathematical models
Miscellaneous
Parameterized complexity
Studies
Theoretical computing
Graph algorithms
Analysis of algorithms
Computational complexity
Parameterized complexity
Zero
Computer theory
Information processing
NP complete problem
Search tree
Algorithm
Algorithm analysis
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!
Popis
Shrnutí:Matrix domination is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same column as all other non-zero entries. Using a kernelization and search tree approach, we show the problem to be fixed-parameter tractable with running time O(n 3+1.959 kk 5/2) .
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2002.12.001