Pages that link to "Item:Q703277"
From MaRDI portal
The following pages link to An approximation algorithm for square packing. (Q703277):
Displaying 13 items.
- 2D knapsack: packing squares (Q388093) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- Complexity and approximation of an area packing problem (Q691403) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- An algorithm for packing squares (Q1268620) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- A linear approximation algorithm for bin packing with absolute approximation factor \(\frac {3}{2}\) (Q1400475) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Improved approximation algorithms for rectangle tiling and packing. (Q2768328) (← links)
- Packing squares with profits (Q2902901) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- Algorithm Theory - SWAT 2004 (Q5315388) (← links)