Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/8224
Title: | Trees, slices, and wheels: On the floorplan area minimization problem | Authors: | Almeida, Ana Maria de Rodrigues, Rosália |
Issue Date: | 2003 | Citation: | Networks. 41:4 (2003) 235-244 | Abstract: | Hierarchical approaches to floorplan design usually use trees to represent hierarchical floorplans, defining topological relations between a set of components to be placed on a (circuit) board. This placement is then optimized to minimize chip area, perimeter, or other such cost measurements. This work places the problem of minimizing hierarchical floorplans of order k within the appropriate theoretical framework and presents an algorithm that uses exclusively the k-ary representation tree to determine the best or minimal solution to a conflicting bicriteria problem. The algorithm does not need predefined partitioning schemes and determines the orientation of each individual component. It can deal both with five-module wheels, as well as slices, and can handle an arbitrary number of realizations for each individual component. © 2003 Wiley Periodicals, Inc. | URI: | https://hdl.handle.net/10316/8224 | DOI: | 10.1002/net.10075 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.