Reflections on multivariate algorithmics and problem parameterization

Abstract : 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.
Document type :
Conference papers
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.17-32, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées


https://hal.inria.fr/inria-00456146
Contributor : Publications Loria <>
Submitted on : Friday, February 12, 2010 - 11:44:48 AM
Last modification on : Friday, February 12, 2010 - 8:52:47 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 8:21:37 PM

File

par-art.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00456146, version 1

Collections

Citation

Rolf Niedermeier. Reflections on multivariate algorithmics and problem parameterization. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.17-32, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. <inria-00456146>

Share

Metrics

Record views

202

Document downloads

353