A theoretical upper bound for IP-based floorplanning

DOI10.1007/11533719_42MaRDI QIDQ5716960zbMATH OpenOpenAlexFDO

Authors Guowu Yang, Xiaoyu Song, Hannah Yang, Fei Xie

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer science aspects of computer-aided design (68U07)

Recommendations

• How good are slicing floorplans?
• Trees, slices, and wheels: On the floorplan area minimization problem
• Optimal module sizing in VLSI floorplanning by nonlinear programming
• Complexity and approximability results for slicing floorplan designs.
• Compact floor-planning via orderly spanning trees

Cited in

(3)

• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• How good are slicing floorplans?
• Strong mixed-integer formulations for the floor layout problem

This page was built for publication: A theoretical upper bound for IP-based floorplanning

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