A 2.5-factor approximation algorithm for the k-MST problem

Information Processing Letters

Volumn 65, Issue 3, 1998, Pages 117-118

  Arya, Sunil ^a   Ramesh, H ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Approximation algorithms; k MST problem

Indexed keywords

EID: 0037845571     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00010-6     Document Type: Article

References (3)

1. A. Blum, P. Chalasani, S. Vempala, A constant factor approximation algorithm for the k-MST problem, in: Proc. ACM Symp. on the Theory of Computing, 1995, pp. 294-302.
2. N. Garg, A 3 factor approximation algorithm for the minimum tree spanning k vertices, in: Proc. IEEE Foundations of Computer Science, 1996, pp. 302-309.
3. M. Goemans, D. Williamson. A general approximation technique for constrained forest problems, SIAM J. Comput. 24 (1995) 296-317.