.png){kind=icon}
Return
Floating Steiner trees
.png){kind=icon}
PRE
AI
DOI：10.1109/12.663766.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the reproducing placement problem, which finds application in layout-driven logic synthesis. In each phase, a module (or gate) is decomposed into two (or more) simpler modules. The goal is to find a good placement in each phase. The problem, being iterative in nature, requires an iterative algorithm. In solving the RPP, we introduce the notion of minimum floating Steiner trees (MFST). We employ an MFST algorithm as a central step in solving the RPP. A Hanan-like theorem is established for the MFST problem, and two approximation algorithms are proposed. Experiments on commonly employed benchmarks verify the effectiveness of the proposed technique.
Keywords:
Steiner trees
exact algorithms
optimization
placement problem
gate level design
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveTula hantavirus NSs protein accumulates in the perinuclear area in infected and transfected cells
PREAI
ShareSave
ShareSaveShareSave
ShareSavePrognostic value of myocardial perfusion imaging in predicting outcome after renal transplantation
PREAI
ShareSave
View more