main page — CS 627 Advanced Algorithms
Unit 4: Fixed-Parameter Algorithms
This unit covers
- Fixed-parameter tractability
- Depth-bounded search trees
- Kernelization
- Linear recurrences
Material
— to be added —
Further reading and sources
Many examples are taken from Advanced Algorithms, following the module in Kaiserslautern initially developed by Markus Nebel.
Further reading:
- M. Cygan et al. (2015): Parameterized Algorithms
The techniques for solving recurrences are described with more detail in an old note I wrote a while ago (keeping the original tone and mistakes for authenticity):