New Approximability and Inapproximability results for 2-dimensional bin packing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 189-196

  Bansal, Nikhil ^a   Sviridenko, Maxim ^b  

^a Carnegie Mellon University   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ASYMPTOTIC POLYNOMIAL TIME APPROXIMATION SCHEMES (APTAS);

ALGORITHMS; ASYMPTOTIC STABILITY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PACKING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMATION THEORY;

EID: 1842435944     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Caprara. Packing 2-dimensional bins in harmony. In Foundations of Computer Science, pages 490-499, 2002.
2. C. Chekuri and S. Khanna. On multi-dimensional packing problems. In Symposium on Discrete Algorithms (SODA), pages 185-194, 1999.
3. F. R. K. Chung, M. R. Garey, and D. S. Johnson. On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3:66-76, 1982.
4. E.G. Coffman, M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: a survey. In D. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 46-93. PWS Publishing, Boston, 1996.
5. E. G. Coffman, M. R. Garey, D. S. Johnson and R. B. Tarjan. Performance bounds for level-oriented two dimensional packing algorithms. SIAM J. Computing 9 (1980), pages 808-826.
6. J. R. Correa and C. Kenyon. Approximation schemes for multidimensional packing. These proceedings.
7. J. Crisik and G. Woeginger. On-line packing and covering problems. In Online Algorithms: The State of the Art, editors A. Fiat and G. Woeginger, pages 147-177, 1998.
8. W. Fernandez de la Vega and G. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1:349-355, 1981.
9. L. Epstein and R. Van Stee. Optimal online bounded space multidimensional packing, These proceedings.
10. C. E. Ferreira, F. K. Miyazawa, and Y. Wakabayashi. Packing squares into squares. Pesquisa Operacional, 19(2):223-237, 1999.
11. K. Jansen and G. Zhang. On rectangle packing: maximizing benefits. These proceedings.
12. V. Kann. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37:27-35, 1991.
13. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Foundations of Computer Science (FOCS), pages 312-320, 1982.
14. Claire Kenyon and Eric Remila. Approximate strip packing. In Foundations of Computer Science (FOCS), pages 31-36, 1996.
15. Y. Kohayakawa, F.K. Miyazawa, P. Raghavan, and Y. Wakabayashi. Multidimensional cube packing. In Brazilian Symposium on Graphs, Algorithms and Combinatorics, 2001.
16. J. Y. T. Leung, T. W. Tam, C. S. Wong, G. H. Young and F. Y. L. Chin. Packing Squares into a Square. Journal of Parallel and Distributed Computing, 10: 271-275, 1990.
17. E. Petrank. The hardness of approximation: gap location. Computational Complexity, 4:133-157, 1994.
18. S. Seiden and R. van Stee. New bounds for multi-dimensional packing. Algorithmica, 36(3):261-293, 2003.
19. S. Sevastianov and G. Woeginger. Makespan minimization in open shops: a polynomial time approximation scheme. Networks and matroids; Sequencing and scheduling. Math. Programming, 82, no. 1-2, Ser. B:191-198, 1998.
20. G. Woeginger. There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters, 64:293-297, 1997.