×

A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing. (English) Zbl 1111.68764

Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 1-2 (2004).
Summary: The talk will survey the rich toolkit of FPT algorithm design methodologies that has developed over the last 20 years, including “older” techniques such as well-quasi-ordering, bounded treewidth, color-coding, reduction to a problem kernel, and bounded search trees – which have continued to deepen and advance – as well as some recently developed approaches such as win/win’s, greedy localization, iterative compression, and crown decompositions.
For the entire collection see [Zbl 1060.68003].

MSC:

68W01 General topics in the theory of algorithms
PDFBibTeX XMLCite
Full Text: DOI