๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Constant-Factor Approximation Algorithm for the Geometric k -MST Problem in the Plane

โœ Scribed by Mitchell, Joseph S. B.; Blum, Avrim; Chalasani, Prasad; Vempala, Santosh

Book ID
118178194
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
301 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Constant-Factor Approximation Algorith
A Constant-Factor Approximation Algorithm for thek-MST Problem
โœ Avrim Blum; R Ravi; Santosh Vempala ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 186 KB

Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the opti

A Constant-Factor Approximation Algorith
A Constant-Factor Approximation Algorithm for the k-Median Problem
โœ Moses Charikar; Sudipto Guha; ร‰va Tardos; David B. Shmoys ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are rel

An approximation algorithm for a bottlen
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
โœ Lusheng Wang; Zimao Li ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in