| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347285 | Computers & Operations Research | 2011 | 6 Pages |
Abstract
We give lower bounds for the competitivity of online algorithms and propose algorithms which match this lower bound up to a constant factor.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Sven O. Krumke, Alfred Taudes, Stephan Westphal,