Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492871zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(14)

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

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)