Algorithmics for Hard Problems
-
Hans-Joachim Böckenhauer, Dennis Komm, Richard Kralovic
-
Spring Semester
-
Location: rack 8, shelf 2
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.
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Fundamentals of Parameterized ComplexityRodney G. Downey, Michael R. Fellows
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Algorithmics for hard problemsIntroduction to combinatorial optimization, randomization, approximation, and heuristics Juraj Hromkovič
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Parameterized algorithmsMarek Cygan [und 7 weitere]
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Invitation to fixed-parameter algorithmsRolf Niedermeier
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() KernelizationTheory of parameterized preprocessing Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Exact exponential algorithmsFedor V. Fomin, Dieter Kratsch
|