Approximation Schemes for Multidimensional Packing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 179-188

  Correa, José R ^a   Kenyon, Claire ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ASYMPTOTIC APPROXIMATION SCHEMES;

ALGORITHMS; ASYMPTOTIC STABILITY; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; PACKING; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

APPROXIMATION THEORY;

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

References (14)

1. N. Bansal and M. Sviridenko (2004). New approximability and inapproximability results for 2-dimensional bin packing. These Proceedings.
2. E.G. Co man, Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 9, 808-826.
3. A. Caprara (2002). Packing 2-Dimensional Bins in Harmony, In Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02).
4. A. Caprara, A. Lodi, and M. Monaci (2003). East Approximation Schemes for the Two-Stage, Two-Dimensional Bin Packing Problem. Research Report OR/03/6 DEIS.
5. W. Fernandez de la Vega and G.S. Lueker (1981). Bin packing can be solved within 1 + ε in polynomial time, Combinatorica 1, 349-355.
6. C.E. Ferreira, F.K. Miyazawa, and Y. Wakabayashi (1999). Packing squares into squares. Pesquisa Operational 19, 349-355.
7. C. Kenyon and E. Remila (2000). A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25, 645-656.
8. D.J. Kleitman and M. Krieger (1975). An optimal bound for two dimensional packing. In Proceeding of the 16th Annual IEEE Symposium on Foundations of Computer Science (FOCS'75).
9. Y. Kohayakawa, F.K. Miyazawa, P. Raghavan, and Y. Wakabayashi (2001). Multidimensional Cube Packing, In Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 2001).
10. J. Y-T. Leung, T.W. Tam, C.S. Wong, G.H. Young, and F.Y.L. Chin (1990). Packing squares into a square. Journal of Parallel and Distributed Computing 10, 271-275
11. P. Novotny (1996). On packing of squares into a rectangle. Archivum Mathematicum 32, 75-83.
12. L. Moser (1965). Poorly formulated unsolved problems is combinatorial geometry. Mimeographed.
13. S.S. Seiden and R. van Stee (2003). New Bounds for Multidimensional Packing, Algorithmica 36, 261-293.
14. V. Vazirani (2001). Approximation Algorithms, Springer-Verlag, Berlin.