An optimal algorithm for layered wheel floorplan designs

DOI10.1002/(SICI)1097-0037(199908)34:1%3C67::AID-NET7%3E3.0.CO;2-WMaRDI QIDQ4262697zbMATH OpenOpenAlexFDO

Authors Priyalal D. Kulsasinghe, Saïd Bettayeb

Publication date 22 September 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199908)34:1%3C67::aid-net7%3E3.0.co;2-w

zbMATH Keywords

computational complexitiesfloorplanorientation optimization problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Optimal orientations of cells in slicing floorplan designs
• Trees, slices, and wheels: On the floorplan area minimization problem
• Complexity and approximability results for slicing floorplan designs.
• Graph-based techniques to speed up floorplan area optimization
• Compact floor-planning via orderly spanning trees

Cites work

• Floorplanning by graph dualization: \(L\)-shaped modules
• Floorplans, planar graphs, and layouts
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• Optimal orientations of cells in slicing floorplan designs

Cited in

(3)

• Optimal orientations of cells in slicing floorplan designs
• Graph-based techniques to speed up floorplan area optimization
• Trees, slices, and wheels: On the floorplan area minimization problem

This page was built for publication: An optimal algorithm for layered wheel floorplan designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262697)