Note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

Information Processing Letters

Volumn 75, Issue 4, 2000, Pages 165-167

  Mandoiu, Ion I ^a   Zelikovsky, Alexander Z ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; VLSI CIRCUITS;

STEINER TREES;

TREES (MATHEMATICS);

EID: 0034275734     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00095-8     Document Type: Article

References (9)

1. Berman P., Ramaiyer V. Improved approximations for the Steiner tree problem. J. Algorithms. Vol. 17:1994;381-408.
2. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, G. Xue, Approximations for Steiner trees with minimum number of Steiner points, March 1999, submitted.
3. Feige U. A threshold of lnn for approximating set cover. J. ACM. Vol. 45:1998;634-652.
4. Guha S., Khuller S. Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inform. and Comput. Vol. 150:1999;57-74.
5. Klein P., Ravi R. A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms. Vol. 19:1995;104-115.
6. Lin G.-H., Xue G. Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform. Process. Lett. Vol. 69:1999;53-57.
7. Robins G., Salowe J.S. Low-degree minimum spanning trees. Discrete Comput. Geom. Vol. 14:1995;151-165.
8. Sarrafzadeh M., Wong C.K. Bottleneck Steiner trees in the plane. IEEE Trans. Comput. Vol. 41:1992;370-374.
9. Zelikovsky A. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica. Vol. 9:1993;463-470.