A 2 + ɛ approximation algorithm for the k-MST problem |
| |
Authors: | Sanjeev Arora George Karakostas |
| |
Affiliation: | (1) Department of Computer Science, Princeton University, USA;(2) Department of Computing & Software, McMaster University, Canada |
| |
Abstract: | For any ɛ > 0 we give a (2 + ɛ)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [10]. As in [10] the algorithm extends to a (2 + ɛ)-approximation algorithm for the minimum tour that visits any k vertices, provided the edge costs satisfy the triangle inequality. Research supported by NSF CAREER award NSF CCR-9502747, NSF grants CCR-0205594 and CCR-0098180, an Alfred Sloan Fellowship, and a Packard Fellowship. Research supported by an NSERC Discovery grant. |
| |
Keywords: | k-Minimum Spanning Tree Approximation algorithm Primal-Dual schema |
本文献已被 SpringerLink 等数据库收录! |
|