On submodular function minimization
Combinatorica
Improved algorithms for submodular function minimization and submodular flow
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
A note on Schrijver's submodular function minimization algorithm
Journal of Combinatorial Theory Series B
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On Convex Minimization over Base Polytopes
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Classes of Submodular Constraints Expressible by Graph Cuts
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
Online prediction under submodular constraints
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
We consider the problem of minimizing a submodular function fdefined on a set Vwith nelements. We give a combinatorial algorithm that runs in O(n5EO + n6) time, where EO is the time to evaluate f(S) for some S茂戮驴 V. This improves the previous best strongly polynomial running time by more than a factor of n.