11 search results - page 1 / 3 » Optimal Resource Augmentations for Online Knapsack |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
It is known that online knapsack is not competitive. This negative result remains true even if the items are removable. In this paper we consider online removable knapsack with
MST
2008
13 years 6 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
DAM
2006
13 years 7 months ago
2006
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
COCOON
2009
Springer
14 years 1 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...