Creating and exploiting flexibility in steiner trees

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 195-198

  Bozorgzadeh, E ^a   Kastner, R ^a   Sarrafzadeh, M ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

STEINER TREES;

ROUTERS;

EID: 0034853542     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378239.378462     Document Type: Conference Paper

References (9)

1. Requirements for models of achievable routing
2. A timing-constrained algorithm for simultaneous global routing of mutiple nets
3. The ISPD98 circuit benchmark suite
4. A new approach to the rectilinear steiner tree problem
5. Benchmarks for layout synthesis evolution and current status
6. DRAGON: Fast standard-cell placement for large circuits
7. Predictable routing