A general method to speed up fixed-parameter-tractable algorithms

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 73; H. 3; S. 125 - 129
Hauptverfasser:	Niedermeier, Rolf, Rossmanith, Peter
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 29.02.2000 Elsevier Science
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science; control theory; systems Decision theory. Utility theory Exact sciences and technology Operational research and scientific management Operational research. Management science Parameterized complexity Theoretical computing Parameterized complexity Algorithms Parmetrized complexity Reduction to problem kernel Fixed parameter tractable algorithm Search tree Acceleration Algorithm Computational complexity Time complexity
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!