Corpus ID: 232134951

Decomposable Submodular Function Minimization via Maximum Flow

@inproceedings{Axiotis2021DecomposableSF,
  title={Decomposable Submodular Function Minimization via Maximum Flow},
  author={Kyriakos Axiotis and Adam Karczmarz and A. Mukherjee and P. Sankowski and Adrian Vladu},
  booktitle={ICML},
  year={2021}
}
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times for this problem by reducing it to a number of calls to a maximum flow oracle. When each function in the decomposition acts on O(1) elements of the ground set V and is polynomially bounded, our running time is up to polylogarithmic factors equal to that of solving maximum flow in a sparse graph with… Expand
1 Citations

References

SHOWING 1-10 OF 62 REFERENCES
Efficient Minimization of Decomposable Submodular Functions
Minimizing a sum of submodular functions
  • V. Kolmogorov
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2012
Fast Decomposable Submodular Function Minimization using Constrained Total Variation
A fast algorithm for the generalized parametric minimum cut problem and applications
Geometric Rescaling Algorithms for Submodular Function Minimization
A push-relabel framework for submodular function minimization and applications to parametric optimization
Subquadratic submodular function minimization
...
1
2
3
4
5
...