Optimum Clustering for Delay Minimization

Rajmohan Rajaraman, D. F. Wong

Research output: Contribution to journalArticlepeer-review


This paper addresses the problem of circuit clustering for delay minimization, subject to area capacity constraints. We use the general delay model, for which only heuristic solutions were known. We present an optimum polynomial-time algorithm for combinational circuits under this model. Our algorithm can be generalized to solve the problem under any monotone clustering constraint.

Original languageEnglish (US)
Pages (from-to)1490-1495
Number of pages6
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Issue number12
StatePublished - Dec 1995
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimum Clustering for Delay Minimization'. Together they form a unique fingerprint.

Cite this