Tight Approximation Guarantees for Concave Coverage Problems.

Siddharth Barman Omar Fawzi Paul Fermé

Published in: CoRR (2020)

Keyphrases

objective function
np complete
lower bound
np hard
worst case
greedy algorithm