Found 3 relevant results in 2.15s where lecturer="Richard Kralovic"
Algorithmics for Hard Problems
Algorithmik für schwere Probleme
This course unit looks into algorithmic approaches to the solving of hard problems, particularly with moderately exponential-time algorithms and parameterized algorithms.The seminar is accompanied by a comprehensive reflection upon the significance of the approaches presented for computer science tuition at high schools.
In this seminar we will cover various topics from modern algorithmics like online algorithms, approximation algorithms, or parameterizations.
We discuss a selection of simple combinatorial algorithms for geometric problems. Such algorithms and problems are characterized by the fact that they deal with geometric primitives such as points and lines, for example in the Euclidean plane.