A Faster Scaling Algorithm for Minimizing Submodular Functions
From MaRDI portal
Publication:4706234
DOI10.1137/S0097539701397813zbMath1033.90106MaRDI QIDQ4706234
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (18)
Rank-width: algorithmic and structural results ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ Theory of Principal Partitions Revisited ⋮ The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ Buyer selection and service pricing in an electric fleet supply chain ⋮ Submodular Function Minimization under a Submodular Set Covering Constraint ⋮ The median partition and submodularity ⋮ The expressive power of valued constraints: Hierarchies and collapses ⋮ The expressive power of binary submodular functions ⋮ Minimizing a sum of submodular functions ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ Submodular function minimization ⋮ Geometric Rescaling Algorithms for Submodular Function Minimization ⋮ A faster strongly polynomial time algorithm for submodular function minimization ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering ⋮ Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
This page was built for publication: A Faster Scaling Algorithm for Minimizing Submodular Functions
