Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimization and several fully combinatorial polynomial-time algorithms have recently been discovered to solve this problem. The most general versions of these algorithms are able to minimize any submodular...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Izdano: |
2008
|