暂无分享,去创建一个
[1] E. G. Coffman,et al. A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors , 1984, Math. Oper. Res..
[2] Richard M. Karp,et al. The Differencing Method of Set Partitioning , 1983 .
[3] Benjamin Yakir,et al. The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp , 1996, Math. Oper. Res..
[4] Z. Tan,et al. κ-Partitioning problems for maximizing the minimum load , 2003 .
[5] Hans Kellerer,et al. Thek-partitioning problem , 1998, Math. Methods Oper. Res..
[6] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..
[7] Moshe Babaioff. Truthful Mechanisms for One-Parameter Agents , 2016, Encyclopedia of Algorithms.
[8] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[9] Yossi Azar,et al. Truthful Approximation Mechanisms for Scheduling Selfish Related Machines , 2005, Theory of Computing Systems.
[10] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[11] Paolo Penna,et al. Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines , 2004, STACS.
[12] Li-Hui Tsai,et al. Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling , 1992, SIAM J. Comput..
[13] Annamária Kovács,et al. Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines , 2005, ESA.
[14] Vincenzo Auletta,et al. Deterministic Monotone Algorithms for Scheduling on Related Machines , 2004, WAOA.
[15] Xin Huang,et al. An Algorithmic Framework for Approximating Maximin Share Allocation of Chores , 2019, EC.