Chips on wafers, or packing rectangles into grids

DOI10.1016/J.COMGEO.2004.05.006zbMATH Open1066.65024OpenAlexW2155559020MaRDI QIDQ705545FDOQ705545

Authors: Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos 

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.05.006

Recommendations

• Chips on wafers (extended abstract)
• Algorithm Theory - SWAT 2004
• Optimal rectangle packing
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• On packing squares into a rectangle

zbMATH Keywords

Computational geometryApproximation algorithmsPacking rectangles

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A typology of cutting and packing problems
• Beyond the flow decomposition barrier
• Finding minimum-cost circulations by canceling negative cycles
• Finding minimum-cost flows by double scaling
• Network flows. Theory, algorithms, and applications.
• On rectangle packing, maximizing benefits
• Recent advances on two-dimensional bin packing problems
• Tafel Musik: Formatting algorithm of tables
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited In (2)

• Optimal wafer cutting in shuttle layout problems
• Chips on wafers (extended abstract)

This page was built for publication: Chips on wafers, or packing rectangles into grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705545)