Proceedings of the 2014 on International Symposium on Physical Design 2014
DOI: 10.1145/2560519.2560529
|View full text |Cite
|
Sign up to set email alerts
|

A fast algorithm for rectilinear steiner trees with length restrictions on obstacles

Abstract: We study the minimum rectilinear Steiner tree problem in the presence of obstacles. Traversing obstacles is not strictly forbidden, but the total length of each connected component in the intersection of the tree with the interior of the blocked area is bounded by a constant. This problem is motivated by the layout of repeater tree topologies, a central task in chip design. Large blockages might be crossed by wires on higher layers, but repeaters may not be placed within the blocked area. A too long unbuffered… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
19
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(19 citation statements)
references
References 17 publications
0
19
0
Order By: Relevance
“…We call this problem as RSMT with reusing routing resources over obstacles (RSMT-RERR). Several models have been developed, and the corresponding solutions to solve RSMT-RERR have been proposed in the literatures [6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…We call this problem as RSMT with reusing routing resources over obstacles (RSMT-RERR). Several models have been developed, and the corresponding solutions to solve RSMT-RERR have been proposed in the literatures [6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…Stephan et al [8] followed the LRSMT model. They built a reach-aware visibility graph, which was a modified version of the visibility graph introduced in [12] for LRSMT.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations