Online Algorithms

By Amos Fiat, G. Woeginger. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Gautam Goel
2. Niangjun Chen
3. Adam Wierman
4. Marco Platzner
5. Herbert Walder
6. Christoph Steiger
7. Matthew R. Longo

Citations in the corpus

• Thinking fast and slow: Optimization decomposition across timescales (2017, methodology): “h respect to this distribution. In contrast, we use the approach of the online algorithms community and analyze the worst-case performance without distributional assumptions via the competitive ratio [17], [21]. Formally, the competitive ratio is defined as follows. Let OPT denote the optimal value o”
• Operating systems for reconfigurable embedded platforms: online scheduling of real-time tasks (2004, background): “Strip packing problems come in many variations, including rotations of boxes, boxes with modifiable aspect ratios, tasks with gravity [ 37 ], and extensions to higher dimensions.”