A combinatorial algorithm minimizing submodular functions in strongly polynomial time Alexander Schrijver1

First Page		Document Content
Date: 2004-08-26 06:01:18 Abstract algebra Vector space Matroid Theorems and definitions in linear algebra Infinite-dimensional holomorphy Mathematics Algebra Submodular set function		A combinatorial algorithm minimizing submodular functions in strongly polynomial time Alexander Schrijver1 Add to Reading List Source URL: homepages.cwi.nl Download Document from Source Website File Size: 101,04 KB Share Document on Facebook