517 search results - page 31 / 104 » Approximation Algorithms for Scheduling with Reservations |
81
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
156
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
139
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
132
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
110
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— A control-plane architecture for supporting advance reservation of dedicated bandwidth channels on a switched network infrastructure is described including the front-end web in...