7930 search results - page 181 / 1586 » Greedy in Approximation Algorithms |
179
click to vote
DISOPT
2006
15 years 6 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
177
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
177
click to vote
JCO
2007
15 years 6 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
177
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...