Linear-Time Approximation Schemes for Clustering Problems
نویسندگان
چکیده
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our approach leads to simple randomized algorithms for the k-means, k-median and discrete k-means problems that yield (1 + ε) approximations with probability ≥ 1/2 and running times of O(2(k/ε)O(1)dn). These are the first algorithms for these problems whose running times are linear in the size of the input (nd for n points in d dimensions) assuming k and ε are fixed. Our method is general enough to be applicable to clustering problems satisfying certain simple properties and is likely to have further applications.
منابع مشابه
Biorthogonal wavelet-based full-approximation schemes for the numerical solution of elasto-hydrodynamic lubrication problems
Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.
متن کاملNear Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs
We present the first fully polynomial approximation schemes for the maximum weighted (uncapacitated or capacitated) b–Matching problems for nonbipartite graphs that run in time (near) linear in the number of edges, that is, given any constant δ > 0 the algorithm produces a (1 − δ) approximation in O(mpoly(δ−1, logn)) time. We provide fractional solutions for the standard linear programming form...
متن کاملApproximation schemes for the generalized geometric problems with geographic clustering
This paper is concerned with polynomial time approximations schemes for the generalized geometric problems with geographic clustering. We illustrate the approach on the generalized traveling salesman problem which is also known as Group-TSP or TSP with neighborhoods. We prove that under the condition that all regions are non-intersecting and have comparable sizes and shapes, the problem admits ...
متن کاملTitle from Practice to Theory; Approximation Schemes for Clustering and Network Design
Abstract What are the performance guarantees of the algorithms used in practice for clustering and network design problems? We answer this question by showing that the standard local search algorithm returns a nearly-optimal solution for low-dimensional Euclidean instances of the traveling salesman problem, Steiner tree, k-median and k-means. The result also extends to the case of graphs exclud...
متن کاملTitle from Practice to Theory, Approximation Schemes for Clustering and Network Design. 2014 Energy-efficient Algorithms for Non-preemptive Speed-scaling. Waoa. Seminar at the 2016 Schloss Dagstuhl Week Event on Algorithms for Optimization Problems in Planar Graphs Algorithms for Embedded Graphs
What are the performance guarantees of the algorithms used in practice for clustering and network design problems? We answer this question by showing that the standard local search algorithm returns a nearly-optimal solution for low-dimensional Euclidean instances of the traveling salesman problem, Steiner tree, k-median and k-means. The result also extends to the case of graphs excluding a fix...
متن کامل