Minimizing a sum of submodular functions
From MaRDI portal
Publication:713320
DOI10.1016/j.dam.2012.05.025zbMath1274.90461OpenAlexW1669076080MaRDI QIDQ713320
Publication date: 26 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.025
Related Items (7)
Hypergraph Cuts with General Splitting Functions ⋮ Generalized roof duality and bisubmodular functions ⋮ Finding a given number of solutions to a system of fuzzy constraints ⋮ Efficient minimization of higher order submodular functions using monotonic Boolean functions ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Minimizing a sum of submodular functions ⋮ Active-set Methods for Submodular Minimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast cost scaling algorithm for submodular flow
- Fast approximate energy minimization with label costs
- Classes of submodular constraints expressible by graph cuts
- Minimizing a sum of submodular functions
- The expressive power of binary submodular functions
- A faster strongly polynomial time algorithm for submodular function minimization
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Geometric applications of a matrix-searching algorithm
- Submodular functions and optimization
- New algorithms for the intersection problem of submodular systems
- Minimizing symmetric submodular functions
- Minimizing a submodular function arising from a concave function
- A capacity scaling algorithm for convex cost submodular flows
- A faster capacity scaling algorithm for minimum cost submodular flow
- Perspectives of Monge properties in optimization
- Beyond the flow decomposition barrier
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- A Faster Scaling Algorithm for Minimizing Submodular Functions
This page was built for publication: Minimizing a sum of submodular functions
