×

zbMATH — the first resource for mathematics

Faster exact algorithms for hard problems: A parameterized point of view. (English) Zbl 0973.68256
Summary: Recent times have seen quite some progress in the development of ‘efficient’ exponential-time algorithms for NP-hard problems. These results are also tightly related to the so-called theory of fixed parameter tractability. In this incomplete, personally biased survey, we reflect on some recent developments and prospects in the field of fixed parameter algorithms.

MSC:
68W05 Nonnumerical algorithms
PDF BibTeX XML Cite
Full Text: DOI