Author:
Morsy Ehab,Nagamochi Hiroshi
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Behjat, L.: New Modeling and Optimization Techniques for the Global Routing Problem. Ph.D. Thesis, University of Waterloo (2002)
2. Behjat, L., Vannelli, A., Rosehart, W.: Integer Linear Programming Models for Global Routing. Informs Journal on Computing 18(2), 137–150 (2002)
3. Berman, P., Ramaiyer, V.: Improved Approximations for the Steiner Tree Problem. J. Algorithms 17, 381–408 (1994)
4. Lecture Notes in Computer Science;Z. Cai,2005
5. Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM J. Appl. Math. 32, 826–843 (1977)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献