DeepAI AI Chat
Log In Sign Up

Improved constant approximation factor algorithms for k-center problem for uncertain data

by   Sharareh Alipour, et al.

In real applications, database systems should be able to manage and process data with uncertainty. Any real dataset may have missing or rounded values, also the values of data may change by time. So, it becomes important to handle these uncertain data. An important problem in database technology is to cluster these uncertain data. In this paper, we study the k-center problem for uncertain points in a general metric space. First we present a greedy approximation algorithm that builds k centers using a farthest-first traversal in k iterations. This algorithm improves the approximation factor of the unrestricted assigned k-center problem from 10 to 6. Next we restrict the centers to be selected from a finite set of points and we show that the optimal solution for this restricted setting is a 2-approximation factor solution for the optimal solution of the assigned k-center problem. Using this idea we improve the approximation factor of the unrestricted assigned k-center problem to 4 by increasing the running time mildly.


page 1

page 2

page 3

page 4


Improvements on the k-center problem for uncertain data

In real applications, there are situations where we need to model some p...

A Composable Coreset for k-Center in Doubling Metrics

A set of points P in a metric space and a constant integer k are given. ...

Improved approximation algorithms for two Euclidean k-Center variants

The k-Center problem is one of the most popular clustering problems. Aft...

Privacy preserving clustering with constraints

The k-center problem is a classical combinatorial optimization problem w...

Noisy, Greedy and Not So Greedy k-means++

The k-means++ algorithm due to Arthur and Vassilvitskii has become the m...

Computing Euclidean k-Center over Sliding Windows

In the Euclidean k-center problem in sliding window model, input points ...

A Constant Approximation Algorithm for Sequential No-Substitution k-Median Clustering under a Random Arrival Order

We study k-median clustering under the sequential no-substitution settin...