@techreport{TR-IC-98-41,
  number = {IC-98-41},
  author = {Carlos E. Ferreira and Flavio K. Miyazawa and Yoshiko Wakabayashi},
  title = {Packing Squares into Squares},
  month = {December},
  year = {1998}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 15 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      We consider the problem of packing a list of squares into unit
      capacity squares. The objective of this problem is to minimize the
      number of squares used in the packing. We consider a restricted
      version of this problem and exhibit a polynomial time algorithm to
      solve it. We use this algoritm in the design of an approximation
      algorithm for the original problem, and show that its asymptotic
      performance bound is 1.988. This bound compares favorably with the
      bound 2.125, known for an algorithm obtained by Chung, Garey and
      Johnson for the more general problem, where the items to be packed are
      rectangles.
  }
}