On convex formulation of the floorplan area minimization problem
ISPD '98 Proceedings of the 1998 international symposium on Physical design
The optimisation of block layout and aisle structure by a genetic algorithm
Computers and Industrial Engineering
An O(nlogn) time algorithm for optimal buffer insertion
Proceedings of the 40th annual Design Automation Conference
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Drawing slicing graphs with face areas
Theoretical Computer Science
A theoretical upper bound for IP-based floorplanning
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.04 |
The traditional algorithm for area minimization of slicing floorplans due to Stockmeyer has time and space complexity O(n2 ) in the worst case. For more than a decade, it has been considered the best possible. This paper presents a new algorithm of worst-case time and space complexity O(n log n), where n is the total number of realizations for the basic blocks, regardless whether the slicing is balanced or not. We also show R(n log n) is the lower bound on the time complexity of any area minimization algorithm. Therefore, the new algorithm not only finds the optimal realization, but also has the optimal running time