Summary: A 2 + # approximation algorithm for the k­MST problem
Sanjeev Arora #
Princeton University
George Karakostas +
Princeton University
Abstract
For any # > 0 we give a (2+#)­approximation al­
gorithm for the problem of finding a minimum tree
spanning any k vertices in a graph (k­MST), improv­
ing a 3­approximation algorithm by Garg [5]. As
in [5] the algorithm extends to a (2+#)­approximation
algorithm for the minimum tour that visits any k ver­
tices, provided the edge costs satisfy the triangle in­
equality.
1 Introduction
Given an undirected graph G = (V, E) with non­
negative edge costs and an integer k, the k­MST
problem is that of finding a tree of minimum cost that
spans exactly k vertices of G; we call such a tree a
k­tree. The problem is known to be NP­complete.

Source: Arora, Sanjeev - Department of Computer Science, Princeton University

Collections: Computer Technologies and Information Sciences