A 3-Approximation for the Minimum Tree Spanning k Vertices

13 years 8 months ago

Download www.carlyerger.com

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

Real-time Traffic

FOCS 1996 | Minimum Tour | Minimum Tree | Theoretical Computer Science |

claim paper

» Covering minimum spanning trees of random subgraphs

» Practical Parallel Algorithms for Minimum Spanning Trees

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» On the Directed DegreePreserving Spanning Tree Problem

» An Olog k approximation algorithm for the k minimum spanning tree problem in the plane

» Fixedparameter tractability results for fulldegree spanning tree and its dual

» Computing Minimum Spanning Trees with Uncertainty

» Euclidean boundeddegree spanning tree ratios

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1996
Where	FOCS
Authors	Naveen Garg

Comments (0)

Sciweavers

A 3-Approximation for the Minimum Tree Spanning k Vertices

FOCS 1996 | Minimum Tour | Minimum Tree | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers