Iterative compression and exact algorithms

Iterative compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems. We exemplify our findings with algorithms for the Maximum Independent Set...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 411; číslo 7; s. 1045 - 1053
Hlavní autoři: Fomin, Fedor V., Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu, Saurabh, Saket
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier B.V 28.02.2010
Elsevier
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer Science
Computer science; control theory; systems
Data Structures and Algorithms
Designs and configurations
Exact sciences and technology
Exponential time algorithms
Fixed parameter algorithms
Graph algorithms
Hitting set
Independent set
Induced cluster
Iterative compression
Mathematics
Memory and file management (including protection and security)
Memory organisation. Data processing
Miscellaneous
Sciences and techniques of general use
Software
Theoretical computing
Iterative compression
Induced cluster
Hitting set
Independent set
Exponential time algorithms
Graph algorithms
Fixed parameter algorithms
Compression
Computer theory
Iterative method
Complexity
Maximum
NP hard problem
Subgraph
Graph algorithm
ISSN:0304-3975, 1879-2294
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í:Iterative compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems. We exemplify our findings with algorithms for the Maximum Independent Set problem, a parameterized and a counting version of d - Hitting Set and the Maximum Induced Cluster Subgraph problem.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2009.11.012