On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem-Reference-Cited by-同舟云学术

On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

Published:2009 Issue: Volume: Page:105-116
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Bae Sang Won,Lee Chunseok,Choi Sunghee

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00202-1_10

Reference12 articles.

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)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determining Sensor Locations in Wireless Sensor Networks;International Journal of Distributed Sensor Networks;2015-08-01

2. On exact solutions to the Euclidean bottleneck Steiner tree problem;Information Processing Letters;2010-07

3. Exact Algorithms for the Bottleneck Steiner Tree Problem;Algorithms and Computation;2009