Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMath1095.68750OpenAlexW2615963353MaRDI QIDQ5315388

Guo-Chuan Zhang, Klaus Jansen

Publication date: 7 September 2005

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

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (10)

\(\gamma\)-soft packings of rectangles ⋮ Rectangle packing with one-dimensional resource augmentation ⋮ Maximizing the throughput of parallel jobs on hypercubes ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ 2D knapsack: packing squares ⋮ On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems ⋮ Structure of polynomial-time approximation ⋮ An approximation algorithm for sequential rectangle placement ⋮ Minimum boundary touching tilings of polyominoes ⋮ Approximation algorithms for orthogonal packing problems for hypercubes

This page was built for publication: Algorithm Theory - SWAT 2004