## FH-OAOS: A Fast Four-Step Heuristic for Obstacle-Avoiding Octilinear Steiner Tree Construction

- Xing Huang, Wenzhong Guo, Genggeng Liu, Guolong Chen
- ACM Trans. Design Autom. Electr. Syst.
- 2016

Highly Influenced

@inproceedings{Lin2007EfficientOR, title={Efficient obstacle-avoiding rectilinear steiner tree construction}, author={Chung-Wei Lin and Szu-Yu Chen and Chi-Feng Li and Yao-Wen Chang and Chia-Lin Yang}, booktitle={ISPD}, year={2007} }

- Published 2007 in ISPD
DOI:10.1145/1231996.1232023

Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (called Steiner points), and avoids running through any obstacle to construct a tree with a minimal total wirelength. The OARSMT problem becomes more important than ever for modern nanometer IC designs which need to consider numerous routing obstacles incurred from power networks, prerouted nets, IP blocks, feature… CONTINUE READING

Highly Cited

This paper has 48 citations. REVIEW CITATIONS

34 Citations

5 References

Similar Papers

Showing 1-5 of 5 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential