An approximation algorithm for sequential rectangle placement

DOI10.1016/J.IPL.2008.08.001zbMATH Open1191.68867OpenAlexW1966528794MaRDI QIDQ975504FDOQ975504

Amos Israeli, Oran Sharon

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.001

Recommendations

• An optimal algorithm for rectangle placement
• An approximation scheme for strip packing of rectangles with bounded dimensions
• scientific article; zbMATH DE number 22188
• Approximate algorithms to pack rectangles into several strips
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

zbMATH Keywords

approximation algorithmssequential rectangle placement

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Introduction to algorithms
• Algorithm Theory - SWAT 2004
• Mathematical Foundations of Computer Science 2005
• Title not available (Why is that?)
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

Cited In (6)

• Title not available (Why is that?)
• An algorithm for polygon placement using a bottom-left strategy
• Complexity and approximation of an area packing problem
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
• An optimal algorithm for rectangle placement
• Placing Text Boxes on Graphs

This page was built for publication: An approximation algorithm for sequential rectangle placement

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