Complexity and approximability results for slicing floorplan designs
Deineko, Vladimir G. and Woeginger, Gerhard J. (2003) Complexity and approximability results for slicing floorplan designs. European Journal of Operational Research, 149 (3). pp. 533-539. ISSN 0377-2217
Restricted to UT campus only: Request a copy
|Abstract:||The first stage in hierarchical approaches to floorplan design determines certain topological relations between the positions of indivisible cells on a VLSI chip. Various optimizations are then performed on this initial layout to minimize certain cost measures such as the chip area. We consider optimization problems in fixing the orientations of the cells and simultaneously fixing the directions of the cuts that are specified by a given slicing tree; the goal is to minimize the area of the chip.
We prove that these problems are NP-hard in the ordinary sense, and we describe a pseudo-polynomial time algorithm for them. We also present fully polynomial time approximation schemes for these problems.
|Copyright:||© 2003 Elsevier|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/75019|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 213303