The Santa Claus problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 31-40

  Bansal, Nikhil ^a   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Maximin; Resource allocation; Scheduling; Unrelated machines

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; LINEAR PROGRAMMING; RESOURCE ALLOCATION; SCHEDULING;

APPROXIMATION ALGORITHMS; CONFIGURATION; SANTA CLAUS PROBLEM; UNRELATED MACHINES;

PROBLEM SOLVING;

EID: 33748118419     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132522     Document Type: Conference Paper

References (13)

1. N. Alon and J. Spencer. The Probabilistic Method. John Wiley and Sons, New York, 2000.
2. Y. Azar and L. Epstein. On-line machine covering. Journal of Scheduling, 1(2):67-77, 1998.
3. I. Bezakova and V. Dani. Allocating indivisible goods. SIGecom Exchanges, 5.3, 2005.
4. J. Csirik, H. Kellerer, and G. Woeginger. The exact lpt-bound for maximizing the minimum completion time. Operations Research Letters, 11(5):281-287, 19982.
5. B. Deuermeyer, D. Friesen, and M. Langsten. Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J. Algebraic Discrete Methods, 3(2):190-196, 1982.
6. D. Golovin. Max-min fair allocation of indivisible goods. Technical Report, Carnegie Mellon University, CMU-CS-05-144, 2005.
7. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Procedeeings of Foundations of Computer Science (FOCS), pages 312-320, 1982.
8. T. Leighton, C. Lu, S. Rao, and A. Srinivasan. New algorithmic aspects of the local lemma with applications to routing and partitioning. SIAM J. Comput., 31(2):626-641, 2001.
9. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, Series A, 46(2):259-271, 1990.
10. R. Lipton, E. Markakis, E. Mossel, and A. Saberi. On approximately fair allocations of indivisible goods. ACM Conference on Electronic Commerce, 2004.
11. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, Series A, 62:461-474, 1993.
12. Z. Tan, Y. He, and L. Epstein. Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Information and Computation, 1196(1):57-70, 2005.
13. G. Woeginger. A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett., 20(4):149-154, 1997.