Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315388
DOI10.1007/b98413zbMath1095.68750MaRDI QIDQ5315388
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
Related Items
2D knapsack: packing squares, Structure of polynomial-time approximation, Rectangle packing with one-dimensional resource augmentation, Maximizing the throughput of parallel jobs on hypercubes, 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, \(\gamma\)-soft packings of rectangles, Approximation and online algorithms for multidimensional bin packing: a survey, Minimum boundary touching tilings of polyominoes