344 search results - page 1 / 69 » The Santa Claus problem |
WOTUG
2008
13 years 7 months ago
2008
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
APPROX
2008
Springer
13 years 7 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...