@inproceedings{guo2021consistent,
author = {Guo, Xiangyu and Kulkarni, Janardhan (Jana) and Li,  Shi and Xian, Jiayi},
title = {Consistent k-Median: Simpler, Better and Robust},
booktitle = {International Conference on Artificial Intelligence and Statistics (AISTATS) 2021},
year = {2021},
month = {April},
abstract = {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^2log^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].},
url = {http://approjects.co.za/?big=en-us/research/publication/consistent-k-median-simpler-better-and-robust/},
}