Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

STACS
2010
Springer

favoriteEmaildiscussreport

167views Theoretical Computer Science» more STACS 2010»

Reflections on Multivariate Algorithmics and Problem Parameterization

13 years 11 months ago

Reflections on Multivariate Algorithmics and Problem Parameterization

Download hal.inria.fr

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 ﬁeld 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

Rolf Niedermeier

Real-time Traffic

Multivariate Algorithmics | Parameterized Algorithmics | Parameterized Complexity Analysis | STACS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Deconstructing intractability A multivariate complexity analysis of interval constrained ...

» On the Genericity of the Modular Polynomial GCD Algorithm

» A Reflective Symmetry Descriptor

» Spatial Clustering of Multivariate Genomic and Epigenomic Information

» A Systematic Approach to ModelGuided Empirical Search for Memory Hierarchy Optimization

» Periodic signal analysis by maximum likelihood modeling of orbits of nonlinear ODEs

» ModeFinding for Mixtures of Gaussian Distributions

» Probabilistic modeling for continuous EDA with Boltzmann selection and KullbackLeibeler di...

» Over Two Decades of IntegrationBased Geometric Flow Visualization

Post Info
More Details (n/a)

Added	14 May 2010
Updated	14 May 2010
Type	Conference
Year	2010
Where	STACS
Authors	Rolf Niedermeier

Comments (0)