A simple combinatorial algorithm for submodular function minimization
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(n6EO log nM) [O (n superscript 6 E O log nM)] time, where n is the cardinality of the ground set, M is the maximum absolute value of the function value, an...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics / Association for Computing Machinery
2011
|
| Online Access: | http://hdl.handle.net/1721.1/65187 https://orcid.org/0000-0002-7488-094X |