A Lottery Model for Center-type Problems With Outliers
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques(2017)
摘要
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 ∈ [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.
更多查看译文
关键词
Approximation algorithms,randomized rounding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络