scientific article; zbMATH DE number 910864

MaRDI QIDQ4886038zbMATH OpenFDO

Authors Maurice Queyranne

Publication date 28 July 1996

zbMATH Keywords

combinatorial algorithmsubmolecular function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• Minimizing symmetric submodular functions
• A fully combinatorial algorithm for submodular function minimization.
• A note on minimizing submodular functions
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

Cited in

(18)

• On submodular function minimization
• Minimizing symmetric submodular functions
• A simple minimum \(T\)-cut algorithm
• A note on the minimization of symmetric and general submodular functions
• Polyhedral structure of submodular and posi-modular systems
• A fully combinatorial algorithm for submodular function minimization.
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• On the \(k\)-cut problem
• An efficient algorithm for the symmetric principal minor assignment problem
• Optimal bounds on approximation of submodular and XOS functions by juntas
• Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
• Submodular minimization via pathwidth
• A note on minimizing submodular functions
• Graphic submodular function minimization: a graphic approach and applications
• scientific article; zbMATH DE number 7051294 (Why is no real title available?)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions
• On minimizing symmetric set functions
• Exact and parameterized algorithms for the independent cutset problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886038)