Sciweavers

FOCS
1996
IEEE

A 3-Approximation for the Minimum Tree Spanning k Vertices

14 years 3 months ago
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.
Naveen Garg
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1996
Where FOCS
Authors Naveen Garg
Comments (0)