Reflections on Multivariate Algorithmics and Problem Parameterization

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. Algorithms and Complexity; Parameterized Algorithmics; Coping with Computational Intractability; Fixed-Parameter Tractability

• Type: Conference
• Year: 2010
• Where: STACS
• Authors: Rolf Niedermeier
• Keywords: Multivariate Algorithmics, Parameterized Algorithmics, Parameterized Complexity Analysis, STACS 2010, Theoretical Computer Science