Vector assignment schemes for asymmetric settings
暂无分享,去创建一个
[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[2] Zsolt Tuza,et al. A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins , 1998, Inf. Process. Lett..
[3] David B. Shmoys,et al. A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..
[4] Edward G. Coffman,et al. Approximation Algorithms for Extensible Bin Packing , 2001, SODA '01.
[5] Jirí Sgall,et al. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.
[6] N. Alon,et al. Approximation schemes for scheduling on parallel machines , 1998 .
[7] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[8] Noga Alon,et al. Approximation schemes for scheduling , 1997, SODA '97.
[9] Yossi Azar,et al. Approximation Schemes for Covering and Scheduling on Related Machines , 1998, APPROX.
[10] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[11] Tamir Tassa,et al. Vector assignment problems: a general framework , 2002, J. Algorithms.
[12] Sanjeev Khanna,et al. On multi-dimensional packing problems , 2004, SODA '99.