A 3-Approximation for the Minimum Tree Spanning k Vertices

In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor the minimum tour that visits any k-vertices.

• Type: Conference
• Year: 1996
• Where: FOCS
• Authors: Naveen Garg
• Keywords: FOCS 1996, Minimum Tour, Minimum Tree, Theoretical Computer Science