On submodular function minimization
From MaRDI portal
Publication:1104332
DOI10.1007/BF02579361zbMath0647.05018OpenAlexW2015429465WikidataQ62111284 ScholiaQ62111284MaRDI QIDQ1104332
Publication date: 1985
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579361
Related Items
A rounding technique for the polymatroid membership problem, On total variation minimization and surface evolution using parametric maximum flows, Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope, Minimum cuts in parametric networks, Decomposition Algorithm for the Single Machine Scheduling Polytope, Generalized polymatroids and submodular flows, Recognition problems for special classes of polynomials in 0-1 variables, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, On additive approximate submodularity, ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM, The holographic entropy cone from marginal independence, On the foundations and extremal structure of the holographic entropy cone, A push-relabel framework for submodular function minimization and applications to parametric optimization, Continuous limits of discrete perimeters, Efficient minimization of higher order submodular functions using monotonic Boolean functions, Paths on polymatroids, Toughness in graphs -- a survey, A strongly polynomial time algorithm for a constrained submodular optimization problem, Submodular function minimization, Dispersing obnoxious facilities on a graph, A faster strongly polynomial time algorithm for submodular function minimization, The base-matroid and inverse combinatorial optimization problems., Minimization of locally defined submodular functions by optimal soft arc consistency, Dispersing Obnoxious Facilities on a Graph, Unnamed Item, Minimizing symmetric submodular functions, The toughness of split graphs, A combinatorial algorithm minimizing submodular functions in strongly polynomial time., A fully combinatorial algorithm for submodular function minimization., A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
Cites Work
