Reflections on Multivariate Algorithmics and Problem Parameterization
Rolf Niedermeier · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2010
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and exploitation of the ``parameter space'' of computationally hard problems.