Abstract:
The notion of a “problem kernel” plays a central role in
the design of fixed-parameter algorithms. The FPT literature is rich in
kernelization algorithms that exhibit fundamentally different approaches.
We highlight these differences and discuss several generalizations and
restrictions of the standard notion.
Citation:
Abu-Khzam, F. N., & Fernau, H. (2006, September). Kernels: Annotated, proper and induced. In International Workshop on Parameterized and Exact Computation (pp. 264-275). Springer Berlin Heidelberg.
