On exact solutions to the euclidean bottleneck steiner tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5431 LNCS, Issue , 2009, Pages 106-116

  Bae, Sang Won ^a   Lee, Chunseok ^a   Choi, Sunghee ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

BOTTLENECK STEINER TREE PROBLEM; EUCLIDEAN PLANES; EXACT ALGORITHMS; EXACT SOLUTION; GEOMETRIC PROPERTIES; OPTIMAL LOCATIONS; STEINER POINTS; TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 67650445959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00202-1_10     Document Type: Conference Paper

References (12)

1. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: The farthest color Voronoi diagram and related problems. Technical Report 002, Institut für Informatik I, Rheinische Fridrich-Wilhelms-Universität Bonn (2006)
2. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. 15th Annu. ACM Sympos. Theory Comput (STOC), pp. 80-86. ACM, New York (1983)
3. Chiang, C., Sarrafzadeh, M., Wong, C.: A powerful global router: based on Steiner min-max trees. In: Proc. IEEE Int. Conf. CAD, pp. 2-5 (1989)
4. Elzinga, J., Hearn, D., Randolph, W.: Minimax multifacility location with Euclidean distances. Transport. Sci. 10, 321-336 (1976)
5. Ganlet, J.L., Salowe, J.S.: Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett. 19, 217-224 (1996)
6. Huttenlocher, D.P., Kedem, K., Shrir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267-291 (1993)
7. Li, Z.-M., Zhu, D.-M., Ma, S.-H.: Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane. J. Comput. Sci. Tech. 19(6), 791-794 (2004)
8. Love, R., Wesolowsky, G., Kraemer, S.: A multifacility minimax location problem with Euclidean distances. J. Prod. Res. 11, 37-45 (1973)
9. Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)
10. Sarrafzadeh, M., Wong, C.: Bottleneck Steiner trees in the plane. IEEE Trans. Comput. 41(3), 370-374 (1992)
11. Wang, L., Du, D.-Z.: Approximations for a bottleneck Steiner tree problem. Algorithmica 32, 554-561 (2002)
12. Wang, L., Li, Z.: An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. Inform. Process. Lett. 81, 151-156 (2002)