Author:
Chow Wing-Kai,Li Liang,Young Evangeline F.Y.,Sham Chiu-Wing
Subject
Electrical and Electronic Engineering,Hardware and Architecture,Software
Reference23 articles.
1. The rectilinear Steiner Tree problem is NP-complete;Garey;SIAM Journal on Applied Mathematics,1977
2. K. L. Clarkson, S. Kapoor, P. M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(nlog2n), in: Proceedings ACM Symposium on Computational Geometry, 1987, pp. 251–257.
3. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles;Wu;IEEE Transaction on Computer-Aided Design,1987
4. J. Ganley, J.P. Cohoon, Routing a multi-terminal critical net: Steiner Tree construction in the presence of obstacles, in: Proceedings of the International Symposium on Circuits and Systems, 1994, pp. 113–116.
5. Finding obstacle-avoiding shortest paths using implicit connection graphs;Wu;IEEE Transactions on Computer-Aided Design,1996
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Guiding Solution Based Local Search for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Problem;IEEE Transactions on Emerging Topics in Computational Intelligence;2024-02
2. A Fast FPGA Connection Router Using Prerouting-Based Parallel Local Routing Algorithm;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-11
3. Obstacle Avoidance Rectilinear Steiner Minimal Tree Length Estimation Using Deep Learning;2023 22nd International Symposium on Communications and Information Technologies (ISCIT);2023-10-16
4. Superfast Full-Scale CPU-Accelerated Global Routing;Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design;2022-10-30
5. Accelerating Computation of Steiner Trees on GPUs;International Journal of Parallel Programming;2021-11-27