Back to Search
Start Over
Buffered Steiner Trees for Difficult Instances.
- Source :
-
IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems . Jan2002, Vol. 21 Issue 1, p3. 12p. 3 Diagrams, 5 Charts, 1 Graph. - Publication Year :
- 2002
-
Abstract
- Focuses on a study which examined Steiner-tree constructions for difficult instances to optimize the buffered tree resulting from the van Ginneken-style buffer insertion. Notation and problem formulation; Information on the proposed clustered tree algorithm; Experimental comparison.
- Subjects :
- *TREE graphs
*MATHEMATICAL optimization
*STEINER systems
Subjects
Details
- Language :
- English
- ISSN :
- 02780070
- Volume :
- 21
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems
- Publication Type :
- Academic Journal
- Accession number :
- 5851427