Partial Subliner Time Approximation and Inapproximation for Maximum Coverage

Abstract

We develop a randomized approximation algorithm for the classical maximum coverage problem, which given a list of sets A1, A2, · · · , An and integer parameter k, select k sets Ai 1 , Ai 2 , · · · , Ai k for maximum union Ai 1 ∪ Ai 2 ∪ · · · ∪ Ai k. In our algorithm, each input set Ai is a black box that can provide its size |Ai|, generate a random element… (More)

Topics

Cite this paper

@article{Fu2016PartialST, title={Partial Subliner Time Approximation and Inapproximation for Maximum Coverage}, author={Bin Fu}, journal={CoRR}, year={2016}, volume={abs/1604.01421} }