Abstract
The design of microchips is a complex process, and is therefore naturally broken down to the design of many smaller components. The largest such components are referred to as `macros'. In these proceedings we investigate the problem of placing macros on a chip optimally, subject to distance and grid constraints. This problem was formulated by Synopsis. As the general problem is known to be NP-hard, we propose several algorithms with various heuristics.
Content
