40 search results - page 1 / 8 » New hardness results for congestion minimization and machine... |
STOC
2004
ACM
14 years 5 months ago
2004
ACM
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
AAAI
1998
13 years 6 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...