Approximating (k,ℓ)-center clustering for curves
share
The Euclidean k-center problem is a classical problem that has been extensively studied in many areas of computer science. Given a set G of n points in Euclidean space, the problem is to determine a set C of k centers (not necessarily part of G) such that the maximum distance between a point in G and its nearest neighbor in C is minimized. In this paper we study the corresponding (k,ℓ)-center problem for polygonal curves under the Fréchet distance, that is, given a set G of n polygonal curves in R^d, each of complexity m, determine a set C of k polygonal curves in R^d, each of complexity ℓ, such that the maximum Fréchet distance of a curve in G to its closest curve in C is minimized. We show that there is no polynomial-time (3/2-ε)-approximation algorithm for any ε > 0 unless P=NP. This bound even holds for one-dimensional curves under the continuous Fréchet distance, and is further improved to (3sin(π/3)-ε) if the curves may lie in the plane and if the discrete Fréchet distance is used. These hardness results hold even when k=1, i.e., for the minimum-enclosing ball version of the problem. At the same time, we prove that a careful adaptation of Gonzalez' algorithm in combination with a curve simplification yields a 3-approximation in any dimension, provided that an optimal simplification can be computed exactly. We give a comprehensive analysis of this approximation scheme in spaces of arbitrary dimension and for both the discrete and continuous Fréchet distances. Overall, our results significantly extend and improve the known approximation bounds for the (k,ℓ)-center clustering problem.
READ FULL TEXT