Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68616OpenAlexW2494705596MaRDI QIDQ5492871

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 methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (11)

Rectangle packing with one-dimensional resource augmentation ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ 2D knapsack: packing squares ⋮ A Polynomial Time Approximation Scheme for the Square Packing Problem ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Online removable square packing ⋮ 2D Knapsack: Packing Squares ⋮ Online square-into-square packing ⋮ On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems ⋮ An approximation algorithm for sequential rectangle placement ⋮ Approximation algorithms for orthogonal packing problems for hypercubes

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