scientific article; zbMATH DE number 2086909

zbMATH Open1049.90530MaRDI QIDQ4737512FDOQ4737512

Authors: Satoru Iwata 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370001.htm

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

Recommendations

• A Faster Scaling Algorithm for Minimizing Submodular Functions
• scientific article; zbMATH DE number 7051294
• Improved algorithms for submodular function minimization and submodular flow
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (14)

• A Faster Scaling Algorithm for Minimizing Submodular Functions
• Bisubmodular Function Minimization
• An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
• Minimizing a sum of submodular functions
• The stochastic location model with risk pooling
• A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
• A note on Schrijver's submodular function minimization algorithm.
• A faster strongly polynomial time algorithm for submodular function minimization
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• A submodular function minimization algorithm based on the minimum-norm base
• Submodular function minimization and related topics
• Efficient minimization of higher order submodular functions using monotonic Boolean functions
• A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
• On the complexity of submodular function minimisation on diamonds

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 Q4737512)