Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design.

Jason Cong Andrew B. Kahng Kwok-Shing Leung Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. 24-39 1998 17 IEEE Trans. on CAD of Integrated Circuits and Systems 1 http://doi.ieeecomputersociety.org/10.1109/43.673630 db/journals/tcad/tcad17.html#CongKL98