scholar.google.com › citations
Sep 8, 2023 · Abstract:We consider the parallel complexity of submodular function minimization (SFM). We provide a pair of methods which obtain two new ...
Dec 1, 2023 · In this paper we study the problem of minimizing a submodular function $f : 2^V \rightarrow \R$ that is guaranteed to have a $k$-sparse ...
Sep 8, 2023 · Abstract. We consider the parallel complexity of submodular function minimization (SFM). We provide a pair of methods which obtain two new ...
This paper considers the submodular minimization problem (SFM), where the submodular function $f$ is bounded between $-M$ and $M$. There has been a large number ...
The NeurIPS Logo above may be used on presentations. Right-click and choose download. It is a vector graphic and may be used at any scale.
Abstract: The problem of minimizing a submodular function (SFM) is a common generalization of several fundamental combinatorial optimization problems, ...
They are set functions which prescribe a value to every subset of an n-element universe, and are defined “locally” as follows: for every subset A of the ...
TLDR: The research paper introduces new algorithms for solving submodular function minimization (SFM) problems efficiently in parallel.
People also ask
What is a submodular function?
Is the cut function submodular?
Abstract. In this paper, we study submodular function minimization in the adaptive complexity model. Seminal work by Gr'otschel, Lovász, and Schrijver shows ...
Nov 7, 2023 · Research has shown that any parallel algorithm for SFM requires a minimum adaptivity that is a polynomial in the size of the ground set. Our ...