Approximation algorithm for bottleneck steiner tree problem in the euclidean plane

Journal of Computer Science and Technology

Volumn 19, Issue 6, 2004, Pages 791-794

  Li, Zi Mao ^a   Zhu, Da Ming ^a   Ma, Shao Han ^a  

^a SHANDONG UNIVERSITY   (China)

Author keywords

Algorithm design and analysis; Approximation algorithm; Bottleneck Steiner tree; Performance ratio

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; ROUTERS; SET THEORY; THEOREM PROVING; VLSI CIRCUITS; WIRELESS TELECOMMUNICATION SYSTEMS;

ALGORITHM DESIGN AND ANALYSIS; APPROXIMATION ALGORITHM; BOTTLENECK STEINER TREE PROBLEM; PERFORMANCE RATIO;

TREES (MATHEMATICS);

EID: 12744281053     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02973441     Document Type: Article

References (5)

1. Bern M, Plassmann P. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, 1989, 32: 171-176.
2. Wang L, Du D Z. Approximations for a bottleneck Steiner tree problem. Algorithmica, 2002, 32: 554-561.
3. Wang L, Li Z. An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. Information Processing Letters, 2002, 81: 151-156.
4. Du D Z, Wang L, Xu B, The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points. In Proceedings of the 7th Annual International Conference on Computing and Combinatorics, Guilin, China, August 2001, LNCS 2108, pp.509-518.
5. Gabow H N, Stallmann M. An augmenting path algorithm for linear matriod parity. Combinatorica, 1986, 6: 123-150.