DeepAI AI Chat
Log In Sign Up

A Simple Combinatorial Algorithm for Robust Matroid Center

by   Georg Anegg, et al.
ETH Zurich

Recent progress on robust clustering led to constant-factor approximations for Robust Matroid Center. After a first combinatorial 7-approximation that is based on a matroid intersection approach, two tight LP-based 3-approximations were discovered, both relying on the Ellipsoid Method. In this paper, we show how a carefully designed, yet very simple, greedy selection algorithm gives a 5-approximation. An important ingredient of our approach is a well-chosen use of Rado matroids. This enables us to capture with a single matroid a relaxed version of the original matroid, which, as we show, is amenable to straightforward greedy selections.


Reverse Greedy is Bad for k-Center

We demonstrate that the reverse greedy algorithm is a Θ(k) approximation...

A Technique for Obtaining True Approximations for k-Center with Covering Constraints

There has been a recent surge of interest in incorporating fairness aspe...

Local Search for Weighted Tree Augmentation and Steiner Tree

We present a technique that allows for improving on some relative greedy...

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

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

Constant-Factor Approximation for Ordered k-Median

We study the Ordered k-Median problem, in which the solution is evaluate...

Techniques for Generalized Colorful k-Center Problems

Fair clustering enjoyed a surge of interest recently. One appealing way ...

Robust k-Center with Two Types of Radii

In the non-uniform k-center problem, the objective is to cover points in...