On Rectangle Packing: Maximizing Benefits

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 197-206

  Jansen, Klaus ^a   Zhang, Guochuan ^a,b  

^a UNIVERSITY OF KIEL   (Germany)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY VALUE PROBLEMS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PACKING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; RECTANGLE PACKING PROBLEMS;

APPROXIMATION THEORY;

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

References (16)

1. B.S. Baker, A.R. Calderbank, E.G. Coffman, and J.C. Lagarias, Approximation algorithms for maximizing the number of squares packed into a rectangle, SIAM J. on Algebraic and Discrete Methods 4 (1983), 383-397.
2. G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani, Improved approximation algorithms for resource allocation, IPCO 2002, LNCS 2337, pp 401-414, 2002.
3. W. Fernandez de la Vega and G.S. Luecker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (1981), 349-355.
4. A. Freund and J. Naor, Approximating the advertisement placement problem, IPCO 2002, LNCS 2337, pp 415-424, 2002.
5. A.M. Frieze and M.R.B. Clarke, Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses, European Journal of Operational Research 15 (1984), 100-109.
6. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of ACM 32 (1985), 130-136.
7. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, Journal of ACM 22 (1975), 463-468.
8. K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Mathematics of Operations Research 26 (2001), 324-338.
9. K. Jansen and G. Zhang, Packing maximum number of rectangles into a rectangle, manuscript, 2003.
10. N. Karmarker and R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, In Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., pp 312-320, 1982.
11. H. Kellerer and U. Pferschy, A new fully polynomial approximation scheme for the knapsack problem, APPROX 98 LNCS 1444, 123-134, 1998.
12. J.Y.-T. Leung, T.W. Tam, C.S. Wong, G.H. Young, and F.Y.L. Chin, Packing squares into a square, J. Parallel Distrib. Comput. 10 (1990), 271-275.
13. I. Schiermeyer, Reverse-fit: a 2-optimal algorithm for packing rectangles, ESA 94, LNCS 855, 290-299, 1994.
14. D. Shmoys and E. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming 62 (1993), 461-474.
15. D. Simchi-Levi, New worst-case results for the bin packing problem, Naval Research Logistics 41 (1994), 579-585.
16. A. Steinberg, A strip-packing algorithm with absolute performance bound 2, SIAM J. Computing 26 (1997), 401-409.