A Lottery Model for Center-Type Problems With Outliers

In this article, we give tight approximation algorithms for the k-center and matroid center problems with outliers. Unfairness arises naturally in this setting: certain clients could always be considered as outliers. To address this issue, we introduce a lottery model in which each client j is allowed to submit a parameter pj ∈ [0,1] and we look for a random solution that covers every client j with probability at least pj. Our techniques include a randomized rounding procedure to round a point inside a matroid intersection polytope to a basis plus at most one extra item such that all marginal probabilities are preserved and such that a certain linear function of the variables does not decrease in the process with probability one.

[1]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2002, SCG '02.

[2]  Shi Li,et al.  Approximating k-median via pseudo-approximation , 2012, STOC '13.

[3]  George L. Nemhauser,et al.  Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..

[4]  Chaitanya Swamy,et al.  Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications , 2013, APPROX-RANDOM.

[5]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

[6]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[7]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[8]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[9]  Ravishankar Krishnaswamy,et al.  The Non-Uniform k-Center Problem , 2016, ICALP.

[10]  Aravind Srinivasan,et al.  An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization , 2014, SODA.

[11]  I M Gel'fand,et al.  Combinatorial geometries and torus strata on homogeneous compact manifolds , 1987 .

[12]  Jian Li,et al.  Matroid and Knapsack Center Problems , 2013, Algorithmica.

[13]  Amit Kumar,et al.  The matroid median problem , 2011, SODA '11.

[14]  Ola Svensson,et al.  Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).