Consistent k-Median: Simpler, Better and Robust

by   Xiangyu Guo, et al.

In this paper we introduce and study the online consistent k-clustering with outliers problem, generalizing the non-outlier version of the problem studied in [Lattanzi-Vassilvitskii, ICML17]. We show that a simple local-search based online algorithm can give a bicriteria constant approximation for the problem with O(k^2 log^2 (nD)) swaps of medians (recourse) in total, where D is the diameter of the metric. When restricted to the problem without outliers, our algorithm is simpler, deterministic and gives better approximation ratio and recourse, compared to that of [Lattanzi-Vassilvitskii, ICML17].


page 1

page 2

page 3

page 4


Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques

In this paper, we consider two types of robust models of the k-median/k-...

k-means++: few more steps yield constant approximation

The k-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is a sta...

Deterministic metric 1-median selection with very few queries

Given an n-point metric space (M,d), metric 1-median asks for a point p∈...

Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding

In this paper, we present a novel iterative rounding framework for many ...

RODIAN: Robustified Median

We propose a robust method for averaging numbers contaminated by a large...

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median

The Uncapacitated Facility Location (UFL) problem is one of the most fun...

On Variants of Facility Location Problem with Outliers

In this work, we study the extension of two variants of the facility loc...