Algorithmics for Hard Problems
- Dennis Komm
- Spring Semester
- Location: rack 8, shelf 2 VVZ-ID: 272-0300-00L Lecture homepage
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.
Not offered this semester.
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Fundamentals of Parameterized ComplexityRodney G. Downey, Michael R. Fellows
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Algorithmics for hard problemsIntroduction to combinatorial optimization, randomization, approximation, and heuristics Juraj Hromkovič
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Parameterized algorithmsMarek Cygan [und 7 weitere]
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Invitation to fixed-parameter algorithmsRolf Niedermeier
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Exact exponential algorithmsFedor V. Fomin, Dieter Kratsch
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
KernelizationTheory of parameterized preprocessing Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
|