An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

13 years 9 months ago

Download www.cs.uwaterloo.ca

Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words. Grids,Travelingsalesmanproblem.

Naveen Garg, Dorit S. Hochbaum

Real-time Traffic

Algorithms | Key Words | Problemof Findingthe Minimumtree | STOC 1994 |

claim paper

» A 3Approximation for the Minimum Tree Spanning k Vertices

» The K kCapacitated Spanning Tree Problem

» Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k2 and 3

» A 25Factor Approximation Algorithm for the kMST Problem

» The Directed MinimumDegree Spanning Tree Problem

» Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation

» Finding the k Smallest Spanning Trees

» An approximate solution method based on tabu search for kminimum spanning tree problems

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	STOC
Authors	Naveen Garg, Dorit S. Hochbaum

Comments (0)

Sciweavers

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

Algorithms | Key Words | Problemof Findingthe Minimumtree | STOC 1994 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers