Improved Parallel Algorithm for Minimum Cost Submodular Cover ProblemDownload PDFOpen Website

2022 (modified: 31 Jan 2023)COLT 2022Readers: Everyone
Abstract: In the minimum cost submodular cover problem (MinSMC), we are given a monotone nondecreasing submodular function $f\colon 2^V \rightarrow \mathbb{Z}^+$, a linear cost function $c: V\rightarrow \mat...
0 Replies

Loading