49 search results - page 1 / 10 » Optimal on-line flow time with resource augmentation |
MST
2008
13 years 4 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 4 months ago
2006
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
COCOON
2006
Springer
13 years 8 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...
WAOA
2004
Springer
13 years 10 months 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...