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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 411; H. 7; S. 1045 - 1053
Hauptverfasser:	Fomin, Fedor V., Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu, Saurabh, Saket
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 28.02.2010 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!