Spring School on Fixed Parameter and Exact Algorithms
May 2529 2009, Lozari, Corsica (France)
Scope:
Fixed parameter tractable (FPT) and exponentialtime algorithms are hot
topics in algorithms. Both approaches aim at reducing the combinatorial
explosion of NPhard problems. In moderately exponentialtime 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 runningtime only
depends on some parameter which is expected to be small in practical use.
The school adresses to doctoral and postdoctoral students as well as
confirmed researchers working in or interested by these areas.
