Pages that link to "Item:Q2892352"
From MaRDI portal
The following pages link to Denser packings obtained in \(O(n \log \log n)\) time (Q2892352):
Displaying 11 items.
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Adaptive cluster growth: A new algorithm for circuit placement in rectilinear regions (Q1186438) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- Two-dimensional packing algorithms for layout of disconnected graphs (Q1857089) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Dynamic reduction heuristics for the rectangle packing area minimization problem (Q2629714) (← links)
- A dynamic algorithm for placing rectangles without overlapping (Q3981722) (← links)
- Computational Science – ICCS 2005 (Q5709627) (← links)
- Automated placement of analog integrated circuits using priority-based constructive heuristic (Q6568458) (← links)