ERC Starting Grant · 2016
Pareto-Optimal Parameterized Algorithms
In this project we revise the foundations of parameterized complexity, a modern multi-variate approach to algorithm design. The underlying question of every algorithmic paradigm is ``what is the best algorithm?'' When the running time of algorithms is measured in terms of only one variable, it is easy to compare which one is the fastest. However, when the running time depends on more than one variable, as is the case for parameterized complexity: **It is not clear what a ``fastest possible algorithm'' really means.** The previous formalizations of what a fastest possible parameterized algorithm means are one-dimensional, contrary to the core philosophy of parameterized complexity. These…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.