Advertisement

Chips on Wafers

(Extended Abstract)
  • Mattias Andersson
  • Joachim Gudmundsson
  • Christos Levcopoulos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

A set of rectangles \(\mathcal{S}\) is said to be grid packed if there exists a rectangular grid (not necessarily regular) such that every rectangle lies in the grid and there is at most one rectangle of \(\mathcal{S}\) in each cell. The area of a grid packing is the area of a minimal bounding box that contains all the rectangles in the grid packing. We present an approximation algorithm that given a set \(\mathcal{S}\) of rectangles and a real constant ε> 0 produces a grid packing of \(\mathcal{S}\) whose area is at most (1 + ε) times larger than an optimal packing in polynomial time. If ε is chosen large enough the running time of the algorithm will be linear. We also study several interesting variants, for example the smallest area grid packing containing at least k ≤ n rectangles, and given a region \(\mathcal{A}\) grid pack as many rectangles as possible within \(\mathcal{A}\). Apart from the approximation algorithms we present several hardness results.

Keywords

Approximation Algorithm Directed Edge Rectangular Region Weight Class Optimal Packing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Tech. rep. CS-TR-164-88. Department of computer science. Princeton University, Princeton, NJ (1988) Google Scholar
  2. 2.
    Anderson, R.J., Sobti, S.: The Table Layout Problem. In: proceedings of Symposium on Computational Geometry, pp. 115–123 (1999)Google Scholar
  3. 3.
    Beach, R.J.: Setting tables and illustrations with style. PhD thesis, Dept. of computer science, University of Waterloo, Canada (1985) Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  5. 5.
    Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM 45(5), 783–797 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Jennings, G.: Personal communication (2002) Google Scholar
  7. 7.
    Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization; Algorithms and Complexity. Dover Publications, Mineola (1998)zbMATHGoogle Scholar
  8. 8.
    Shin, K., Kobayashi, K., Suzuki, A.: TAFEL MUSIK, formatting algorithm of tables. In: proceedings of Principles of Document Processing (1994)Google Scholar
  9. 9.
    Wang, X., Wood, D.: Tabular formatting problems. In: proceedings of Principles of Document Processing (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mattias Andersson
    • 1
  • Joachim Gudmundsson
    • 2
  • Christos Levcopoulos
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.Department of Mathematics and Computing ScienceTU EindhovenEindhovenThe Netherlands

Personalised recommendations