Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
We present an efficient algorithm to find nonempty minimizers of a symmetric submodular function f over any family of sets I closed under inclusion. Our algorithm makes O(n[superscript 3]) oracle calls to f and I, where n is the cardinality of the ground set. In contrast, the problem of minimizing a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2013-09-23T12:47:04Z.
|
| Subjects: | |
| Online Access: | Get fulltext |