Approximation and Online Algorithms
- Hans-Joachim Böckenhauer, Dennis Komm, Manuel Wettstein
- Spring Semester
- Location: rack 8, shelf 5 VVZ-ID: 272-0302-00L Lecture homepage
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.
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
An Introduction to Online ComputationDeterminism, Randomization, Advice by Dennis Komm
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
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
Online algorithmsThe state of the art Amos Fiat, Gerhard J. Woeginger, (eds.)
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
Online computation and competitive analysisAllan Borodin, Ran El-Yaniv
|