A Lottery Model for Center-type Problems With Outliers
Data Structures and Algorithms
2017-10-03 v1
Abstract
In this paper, we give tight approximation algorithms for the -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 is allowed to submit a parameter and we look for a random solution that covers every client with probability at least . 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.
Keywords
Cite
@article{arxiv.1710.00287,
title = {A Lottery Model for Center-type Problems With Outliers},
author = {David G. Harris and Thomas Pensyl and Aravind Srinivasan and Khoa Trinh},
journal= {arXiv preprint arXiv:1710.00287},
year = {2017}
}