An approximation algorithm for sequential rectangle placement

DOI10.1016/J.IPL.2008.08.001MaRDI QIDQ975504zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

approximation algorithmssequential rectangle placement

Mathematics Subject Classification ID

Approximation algorithms (68W25)

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

Cites work

• Algorithm Theory - SWAT 2004
• Introduction to algorithms
• Mathematical Foundations of Computer Science 2005
• On rectangle packing, maximizing benefits
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

Cited in

(8)

• Placing Text Boxes on Graphs
• scientific article; zbMATH DE number 569959 (Why is no real title available?)
• An algorithm for polygon placement using a bottom-left strategy
• On the approximability of orthogonal order preserving layout adjustment
• Complexity and approximation of an area packing problem
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
• On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
• An optimal algorithm for rectangle placement

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)