منابع مشابه
Faster Geometric K-point MST Approximation
We give fast new approximation algorithms for the problem of choosing k planar points out of n to minimize the length of their minimum spanning tree (equivalently, of their traveling salesman tour or Steiner tree). For any x ≤ k, we can find an approximation achieving approximation ratio O(log k/ log x) in time O(n log n+ 2kn log k). In particular, we get an approximation with ratio O(log k/ lo...
متن کاملA Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane
We show that any rectilinear polygonal subdivision in the plane can be converted into a “guillotine” subdivision whose length is at most twice that of the original subdivision. “Guillotine” subdivisions have a simple recursive structure that allows one to search for “optimal” such subdivisions in polynomial time, using dynamic programming. In particular, a consequence of our main theorem is a v...
متن کاملA Constant-Factor Approximation Algorithm for k-MST Problem
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 optimum. This improves upon previous performance ratios for this problem &O(k) due to Ravi et al., O(...
متن کاملA Constant-Factor Approximation Algorithm for the k-MST Problem
Given an undirected graph with non negative edge costs and an inte ger k the k MST problem is that of nding a tree of minimum cost on k nodes This problem is known to be NP hard We present a simple approximation algorithm that nds a solution whose cost is less than times the cost of the optimum This improves upon previous performance ratios for this problem O p k due to Ravi et al O log k due t...
متن کاملA 2 + ǫ approximation algorithm for the k-MST problem
For any ǫ > 0 we give a (2+ǫ)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [5]. As in [5] the algorithm extends to a (2+ǫ)-approximation algorithm for the minimum tour that visits any k vertices, provided the edge costs satisfy the triangle inequality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1997
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(96)00021-1