A note on Schrijver's submodular function minimization algorithm.

DOI10.1016/S0095-8956(02)00047-3zbMATH Open1033.90111MaRDI QIDQ1400972FDOQ1400972

Authors: Jens Vygen 

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Recommendations

• A note on minimizing submodular functions
• On submodular function minimization
• scientific article; zbMATH DE number 7051294
• A fully combinatorial algorithm for submodular function minimization.
• A note on submodular function minimization by Chubanov's LP algorithm
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Submodular function minimization and related topics
• Submodular function minimization
• Submodular function minimization
• Submodular functions: optimization and approximation

zbMATH Keywords

submodular function minimization algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cites Work

• Geometric algorithms and combinatorial optimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Title not available (Why is that?)
• Improved algorithms for submodular function minimization and submodular flow

Cited In (6)

• Minimizing convex functions with rational minimizers
• Submodular function minimization
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• A note on submodular function minimization by Chubanov's LP algorithm
• A faster strongly polynomial time algorithm for submodular function minimization
• A strongly polynomial algorithm for line search in submodular polyhedra

This page was built for publication: A note on Schrijver's submodular function minimization algorithm.

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