Author:
Fößmeier Ulrich,Kaufmann Michael
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. S. Arora, Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems. In Proc. of 37th Annual IEEE Symp. on Foundations of Computer Science, 2–11, 1996.
2. P. Berman and V. Ramaiyer. Improved approximations for the Steiner tree problem. Proc. of 3d ACM-SIAM Symp. on Discrete Algorithms, 325–334, 1992.
3. U. Fößmeier and M. Kaufmann. On Exact Solutions for the Rectilinear Steiner Tree Problem. Technical Report WSI-96-09, Universität Tübingen, 1996.
4. U. Fößmeier and M. Kaufmann. On Exact Solutions for the Rectilinear Steiner Tree Problem. ACM Conference on Computational Geometry: Poster Session, 1997 (3 pages).
5. Ganley J. L., J. P. Cohoon, Optimal rectilinear Steiner minimal trees in O(n22.62n) time, Proc. 6th Canad.Conf.Comput.Geom., 308–313, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献