scientific article; zbMATH DE number 910864

zbMATH Open0847.05064MaRDI QIDQ4886038FDOQ4886038

Maurice Queyranne

Publication date: 28 July 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatorial algorithmsubmolecular function

Mathematics Subject Classification ID

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

Cited In (14)

• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• Title not available (Why is that?)
• On minimizing symmetric set functions
• A fully combinatorial algorithm for submodular function minimization.
• A simple minimum \(T\)-cut algorithm
• On the \(k\)-cut problem
• A note on minimizing submodular functions
• Polyhedral structure of submodular and posi-modular systems
• Minimizing symmetric submodular functions
• Exact and parameterized algorithms for the independent cutset problem
• Optimal bounds on approximation of submodular and XOS functions by juntas
• An efficient algorithm for the symmetric principal minor assignment problem
• Efficient minimization of higher order submodular functions using monotonic Boolean functions
• A note on the minimization of symmetric and general submodular functions

   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. 👍 👎
• A combinatorial, strongly polynomial-time algorithm for minimizing 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)