A note on Schrijver's submodular function minimization algorithm.

DOI10.1016/S0095-8956(02)00047-3zbMath1033.90111MaRDI QIDQ1400972

Jens Vygen

Publication date: 17 August 2003

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

zbMATH Keywords

submodular function minimization algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ Submodular function minimization ⋮ A faster strongly polynomial time algorithm for submodular function minimization

Cites Work

• Geometric algorithms and combinatorial optimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Improved algorithms for submodular function minimization and submodular flow
• Unnamed Item

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