The following pages link to Algorithm Theory - SWAT 2004 (Q5315388):
Displaying 16 items.
- 2D knapsack: packing squares (Q388093) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- Maximizing the total profit of rectangles packed into a rectangle (Q878442) (← links)
- On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems (Q958309) (← links)
- An approximation algorithm for sequential rectangle placement (Q975504) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- \(\gamma\)-soft packings of rectangles (Q1615640) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Minimum boundary touching tilings of polyominoes (Q3376538) (← links)
- Algorithms and Data Structures (Q5900772) (← links)