Minimum area joining of k compacted cells

Please use this identifier to cite or link to this item: https://doi.org/10.1016/0020-0190(96)00057-9

Title:	Minimum area joining of k compacted cells
Authors:	Lim, A.
Keywords:	Algorithms Compacted cells Single layer routing VLSI design
Issue Date:	24-Jun-1996
Citation:	Lim, A. (1996-06-24). Minimum area joining of k compacted cells. Information Processing Letters 58 (6) : 265-269. ScholarBank@NUS Repository. https://doi.org/10.1016/0020-0190(96)00057-9
Abstract:	We study the problem of joining k compacted cells in a row. We propose an O(n2) algorithm for the joining of k compacted cells problem if the stretching on one side of a cell does not affect the other side of the cell. If the stretching on one side of a cell affects the other side, we obtain a linear time algorithm for minimum area joining when all the channel densities between cells are known.
Source Title:	Information Processing Letters
URI:	http://scholarbank.nus.edu.sg/handle/10635/99335
ISSN:	00200190
DOI:	10.1016/0020-0190(96)00057-9
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check