Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68616OpenAlexW2494705596MaRDI QIDQ5492871FDOQ5492871

Authors: Olga Gerber, Roberto Solis-Oba, Aleksei V. Fishkin, Klaus Jansen 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Algorithms and Computation
• Algorithm Theory - SWAT 2004
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Packing squares with profits
• On packing squares into a rectangle

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Cited In (12)

• Online removable square packing
• Approximation algorithms for orthogonal packing problems for hypercubes
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
• An approximation algorithm for sequential rectangle placement
• Rectangle packing with one-dimensional resource augmentation
• 2D knapsack: packing squares
• A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
• Algorithms and Computation
• Packing squares into rectangles
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Efficient approximation algorithms for scheduling moldable tasks
• 2D knapsack: packing squares

This page was built for publication: Mathematical Foundations of Computer Science 2005

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