Accelerated Relax-and-Round for Concave Coverage Problems
arXiv:2605.06900v1 Announce Type: cross
Abstract: We present an accelerated relax-and-round algorithm for concave coverage problems, which generalize the classic maximum coverage problem. Building on the relax-and-round framework of Barman et al. [STA…