There is no Asymptotic PTAS for Two-Dimensional Vector Packing
暂无分享,去创建一个
[1] George Markowsky,et al. Multidimensional Bin Packing Algorithms , 1977, IBM J. Res. Dev..
[2] D. S. Johnson,et al. On Packing Two-Dimensional Bins , 1982 .
[3] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[4] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..
[5] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[6] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[7] Noga Alon,et al. On-Line and Off-Line Approximation Algorithms for Vector Covering Problems , 1998, Algorithmica.
[8] Carsten Lund,et al. Hardness of approximations , 1996 .
[9] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.