1. M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacristán, The farthest color Voronoi diagram and related problems, Technical Report 002, Institut für Informatik I, Rheinische Fridrich-Wilhelms-Universität, Bonn, 2006
2. Exact algorithms for the bottleneck Steiner tree problem;Bae,2009
3. S.W. Bae, C. Lee, S. Choi, On exact solutions to the Euclidean bottleneck Steiner tree problem, in: Proc. 3rd Workshop Alg. Comput. (WALCOM), 2009, pp. 105–116
4. Lower bounds for algebraic computation trees;Ben-Or,1983
5. C. Chiang, M. Sarrafzadeh, C. Wong, A powerful global router: Based on Steiner min–max trees, in: Proc. IEEE Int. Conf. CAD, 1989, pp. 2–5