Approximation and Online Algorithms
-
Dennis Komm
-
Spring Semester
-
Location: rack 8, shelf 5
This lecture deals with approximative algorithms for hard optimization problems and algorithmic approaches for solving online problems as well as the limits of these approaches.
Not offered this semester.
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() An Introduction to Online ComputationDeterminism, Randomization, Advice by Dennis Komm
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Algorithmics for hard problemsIntroduction to combinatorial optimization, randomization, approximation, and heuristics Juraj Hromkovič
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Online algorithmsThe state of the art Amos Fiat, Gerhard J. Woeginger, (eds.)
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() Online computation and competitive analysisAllan Borodin, Ran El-Yaniv
|