Please use this identifier to cite or link to this item: https://doi.org/10.1016/0020-0190(96)00057-9
DC FieldValue
dc.titleMinimum area joining of k compacted cells
dc.contributor.authorLim, A.
dc.date.accessioned2014-10-27T06:03:03Z
dc.date.available2014-10-27T06:03:03Z
dc.date.issued1996-06-24
dc.identifier.citationLim, 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
dc.identifier.issn00200190
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99335
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/0020-0190(96)00057-9
dc.sourceScopus
dc.subjectAlgorithms
dc.subjectCompacted cells
dc.subjectSingle layer routing
dc.subjectVLSI design
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi10.1016/0020-0190(96)00057-9
dc.description.sourcetitleInformation Processing Letters
dc.description.volume58
dc.description.issue6
dc.description.page265-269
dc.description.codenIFPLA
dc.identifier.isiutA1996VA91800001
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on May 5, 2021

WEB OF SCIENCETM
Citations

2
checked on Apr 28, 2021

Page view(s)

78
checked on May 2, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.