Spring School on Fixed Parameter and Exact Algorithms
May 25-29 2009, Lozari, Corsica (France)
Fixed parameter tractable (FPT) and exponential-time algorithms are hot
topics in algorithms. Both approaches aim at reducing the combinatorial
explosion of NP-hard problems. In moderately exponential-time algorithms,
we search for fastest possible exact algorithms – typically the
exponential time depends on the size of the instance – which should be
practical on instances of moderate sizes. In FPT, the idea is to design
algorithms for which the exponential factor of the running-time only
depends on some parameter which is expected to be small in practical use.
The school adresses to doctoral and post-doctoral students as well as
confirmed researchers working in or interested by these areas.