Approximation algorithms for the rectilinear Steiner tree problem with obstacles
暂无分享,去创建一个
[1] Ion I. Mandoiu,et al. A new heuristic for rectilinear Steiner trees , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).
[2] Andrew B. Kahng,et al. A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Chak-Kuen Wong,et al. Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles , 1987, IEEE Transactions on Computers.
[4] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[5] Kurt Mehlhorn,et al. A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..
[6] M. Minoux. Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity , 1990 .
[7] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[8] J. S. Lee,et al. Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .
[9] Der-Tsai Lee,et al. An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem , 1980 .
[10] Piotr Berman,et al. Improved approximations for the Steiner tree problem , 1992, SODA '92.
[11] Frank K. Hwang,et al. An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.
[12] J. MacGregor Smith,et al. STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN , 1979 .