A Polynomial Algorithm fo
A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions
A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions
This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at least $k$. This paper provides a polynomial time algorithm to …
