The Santa Claus problem
暂无分享,去创建一个
[1] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..
[2] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[3] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[4] Yossi Azar,et al. On-Line Machine Covering , 1997, ESA.
[5] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] Leah Epstein,et al. Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data , 2005, Inf. Comput..
[8] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[9] D. Golovin. Max-min fair allocation of indivisible goods , 2005 .
[10] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[11] D. K. Friesen,et al. SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM , 1982 .
[12] Gerhard J. Woeginger,et al. The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..
[13] Aravind Srinivasan,et al. New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.