DeepAI AI Chat
Log In Sign Up

Improved approximation algorithms for two Euclidean k-Center variants

by   Haris Angelidakis, et al.
ETH Zurich

The k-Center problem is one of the most popular clustering problems. After decades of work, the complexity of most of its variants on general metrics is now well understood. Surprisingly, this is not the case for a natural setting that often arises in practice, namely the Euclidean setting, in which the input points are points in ℝ^d, and the distance between them is the standard ℓ_2 Euclidean distance. In this work, we study two Euclidean k-Center variants, the Matroid Center problem on the real line and the Robust Euclidean k-Supplier problem, and provide algorithms that improve upon the best approximation guarantees known for these problems. In particular, we present a simple 2.5-approximation algorithm for the Matroid Center problem on the real line, thus improving upon the 3-approximation factor algorithm of Chen, Li, Liang, and Wang (2016) that works for general metrics. Moreover, we present a (1 + √(3))-approximation algorithm for the Robust Euclidean k-Supplier problem, thus improving upon the state-of-the-art 3-approximation algorithm for Robust k-Supplier on general metrics and matching the best approximation factor known for the non-robust setting by Nagarajan, Schieber and Shachnai (2020).


page 1

page 2

page 3

page 4


On Some Variants of Euclidean K-Supplier

The k-Supplier problem is an important location problem that has been ac...

Connected k-Center and k-Diameter Clustering

Motivated by an application from geodesy, we introduce a novel clusterin...

Computing Euclidean k-Center over Sliding Windows

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

Computing optimal shortcuts for networks

We study augmenting a plane Euclidean network with a segment, called a s...

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

In real applications, database systems should be able to manage and proc...

Fully dynamic clustering and diversity maximization in doubling metrics

We present approximation algorithms for some variants of center-based cl...

The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction

We study the effect of Johnson-Lindenstrauss transforms in various Eucli...