93 search results - page 14 / 19 » A Survey on Approximation Algorithms for Scheduling with Mac... |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
DMIN
2006
13 years 9 months ago
2006
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
IPCO
1998
13 years 9 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...