Tight Approximation Bounds for Maximum Multi-Coverage

In the classic maximum coverage problem, we are given subsets \(T_1, \dots, T_m\) of a universe \([n]\) along with an integer \(k\) and the objective is to find a subset \(S \subseteq [m]\) of size \(k\) that maximizes \(C(S) := |\cup_{i \in S} T_i|\). It is well-known that the greedy algorithm for...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Barman, Siddharth, Omar, Fawzi, Ghoshal, Suprovat, Gürpınar, Emirhan
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 22.05.2022
Subjects:	Approximation Decision trees Greedy algorithms Matching Mathematical analysis Ratios Universe
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!