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)

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

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)