eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-08-11
10:1
10:19
10.4230/LIPIcs.APPROX-RANDOM.2017.10
article
A Lottery Model for Center-Type Problems with Outliers
Harris, David G.
Pensyl, Thomas
Srinivasan, Aravind
Trinh, Khoa
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 is allowed to submit a parameter indicating the lower-bound on the probability that it should be covered and we look for a random solution that satisfies all the given requests. Out 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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol081-approx-random2017/LIPIcs.APPROX-RANDOM.2017.10/LIPIcs.APPROX-RANDOM.2017.10.pdf
approximation algorithms
randomized rounding
clustering problems