Web: http://arxiv.org/abs/2101.10902

May 6, 2022, 1:11 a.m. | Ge Liu, Alexander Dimitrakakis, Brandon Carter, David Gifford

cs.LG updates on arXiv.org arxiv.org

We introduce the maximum $n$-times coverage problem that selects $k$ overlays
to maximize the summed coverage of weighted elements, where each element must
be covered at least $n$ times. We also define the min-cost $n$-times coverage
problem where the objective is to select the minimum set of overlays such that
the sum of the weights of elements that are covered at least $n$ times is at
least $\tau$. Maximum $n$-times coverage is a generalization of the multi-set
multi-cover problem, is …

arxiv bio design vaccine

More from arxiv.org / cs.LG updates on arXiv.org

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC

Senior Data Science Writer

@ NannyML | Remote

Director of AI/ML Engineering

@ Armis Industries | Remote (US only), St. Louis, California

Digital Analytics Manager

@ Patagonia | Ventura, California