A tight analysis of the submodular-supermodular procedure
From MaRDI portal
Publication:2345618
Recommendations
- Subquadratic submodular function minimization
- On complexity of maximizatin of submodular functions*
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- A faster strongly polynomial time algorithm for submodular function minimization
- Improved algorithms for submodular function minimization and submodular flow
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 50596 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- An analysis of approximations for maximizing submodular set functions—I
- Convex Polytopes
- DC programming: overview.
- Linear programming, the simplex algorithm and simple polytopes
- Maximizing Non-monotone Submodular Functions
- Optimal value of information in graphical models
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
Cited in
(3)
This page was built for publication: A tight analysis of the submodular-supermodular procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345618)