Name
Abstract | ||
|---|---|---|
We consider a natural online optimization problem set on the real line. The state of the online algorithm at each integer time is a location on the real line. At each integer time, a convex function arrives online. In response, the online algorithm picks a new location. The cost paid by the online algorithm for this response is the distance moved plus the value of the function at the final destination. The objective is then to minimize the aggregate cost over all time. The motivating application is rightsizing power-proportional data centers. We give a 2-competitive algorithm for this problem. We also give a 3-competitive memoryless algorithm, and show that this is the best competitive ratio achievable by a deterministic memoryless algorithm. Finally we show that this online problem is strictly harder than the standard ski rental problem. |
Year | Venue | Field |
|---|---|---|
2015 | APPROX-RANDOM | Ski rental problem,Integer,Online algorithm,Mathematical optimization,Real line,Problem set,Convex function,Convex optimization,Mathematics,Competitive analysis |
DocType | Citations | PageRank |
Conference | 10 | 0.58 |
References | Authors | |
10 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikhil Bansal | 1 | 3043 | 230.41 |
| Anupam Gupta | 2 | 2989 | 210.44 |
| Ravishankar Krishnaswamy | 3 | 322 | 25.01 |
| Kirk Pruhs | 4 | 2286 | 192.78 |
| Kevin Schewior | 5 | 37 | 9.79 |
| C Stein | 6 | 1207 | 125.21 |