A Lottery Model for Center-Type Problems with Outliers

In this paper, 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 $p_j \in [0,1]$ and we look for a random solution that covers every client $j$ with probability at least $p_j$. 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]  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).

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

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

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

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

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

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

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

[9]  Chaitanya Swamy.  Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications , 2014, APPROX-RANDOM.

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

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

[12]  Aravind Srinivasan,et al.  Fairness in Resource Allocation and Slowed-down Dependent Rounding , 2017, ArXiv.

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

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