Packing squares with profits

DOI10.1137/080717110MaRDI QIDQ2902901zbMATH OpenOpenAlexFDO

Authors Roberto Solis-Oba, Klaus Jansen

Publication date 22 August 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080717110

zbMATH Keywords

polynomial time approximation schemesquare packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Maximizing the total profit of rectangles packed into a rectangle
• On rectangle packing, maximizing benefits
• On packing rectangles with resource augmentation: maximizing the profit
• An approximation algorithm for square packing.

Cited in

(6)

• Mathematical Foundations of Computer Science 2005
• Maximizing the total profit of rectangles packed into a rectangle
• On rectangle packing, maximizing benefits
• On packing rectangles with resource augmentation: maximizing the profit
• Packing squares independently
• A Polynomial Time Approximation Scheme for the Square Packing Problem

This page was built for publication: Packing squares with profits

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