Complexity and approximability results for slicing floorplan designs.
From MaRDI portal
(Redirected from Complexity and approximability results for slicing floorplan designs.)
Recommendations
Cites work
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Optimal cutting directions and rectangle orientation algorithm
- Optimal orientations of cells in slicing floorplan designs
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(8)- On the complexity of wafer-to-wafer integration
- On the complexity of wafer-to-wafer integration
- Optimal orientations of cells in slicing floorplan designs
- How good are slicing floorplans?
- An optimal algorithm for layered wheel floorplan designs
- scientific article; zbMATH DE number 510756 (Why is no real title available?)
- Trees, slices, and wheels: On the floorplan area minimization problem
- A theoretical upper bound for IP-based floorplanning
This page was built for publication: Complexity and approximability results for slicing floorplan designs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399599)