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/ log logn) in time O(kn). ∗Work supported in part by NSF grant CCR-9258355 and by matching funds from
منابع مشابه
New three-step iteration process and fixed point approximation in Banach spaces
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
متن کاملA Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n logn) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Williamson. This improves the previous best algorithms in both performance guarantee and running time. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires an approximation algorithm for the ...
متن کاملApproximate Geometric MST Range Queries
Range searching is a widely-used method in computational geometry for efficiently accessing local regions of a large data set. Typically, range searching involves either counting or reporting the points lying within a given query region, but it is often desirable to compute statistics that better describe the structure of the point set lying within the region, not just the count. In this paper ...
متن کاملGuillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
We show that any polygonal subdivision in the plane can be converted into an “mguillotine” subdivision whose length is at most (1 + c m ) times that of the original subdivision, for a small constant c. “m-Guillotine” subdivisions have a simple recursive structure that allows one to search for the shortest of such subdivisions in polynomial time, using dynamic programming. In particular, a conse...
متن کاملEnergy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms
Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity. However, in many settings, a more accurate and relevant measure of performance is required. In ad hoc wireless networks, energy is a very critical factor for measuring the efficiency of a distributed algorithm. Thus in addition to the traditional time and message complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 8 شماره
صفحات -
تاریخ انتشار 1997