11 search results - page 2 / 3 » Optimal Resource Augmentations for Online Knapsack |
WAOA
2004
Springer
14 years 8 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
COCOON
2006
Springer
13 years 10 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
CPAIOR
2006
Springer
13 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...