Efficient Steiner tree construction based on spanning graphs

Authors:
Hai Zhou
Affiliations:
Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 9

Associative skew clock routing for difficult instances

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Optimal jumper insertion for antenna avoidance under ratio upper-bound

Proceedings of the 43rd annual Design Automation Conference
Efficient obstacle-avoiding rectilinear steiner tree construction

Proceedings of the 2007 international symposium on Physical design
Maze routing steiner trees with effective critical sink optimization

Proceedings of the 2007 international symposium on Physical design
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction

Proceedings of the 2008 international symposium on Physical design
An innovative Steiner tree based approach for polygon partitioning

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
An efficient rectilinear Steiner tree algorithm with obstacles

CSECS'06 Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing
Obstacle-avoiding rectilinear Steiner tree construction

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

International Journal of Parallel Programming

Quantified Score

Hi-index	0.03

Visualization

Abstract

The Steiner Minimal Tree (SMT) problem is a very important problem in very large scale integrated computer-aided design. Given n points on a plane, an SMT connects these points through some extra points (called Steiner points) to achieve a minimal total length. Even though there exist many heuristic algorithms for this problem, they have either poor performances or expensive running time. This paper records an implementation of an efficient SMT algorithm that has a worst case running time of O(nlogn) and a performance close to that of the Iterated 1-Steiner algorithm. The algorithm efficiently combines Borah et al.'s edge substitute concept with Zhou et al.'s spanning graph. Extensive experimental studies are conducted to compare it with other programs.