Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms
<em>The submodular function minimization problem</em> (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 min...
| Main Authors: | , , |
|---|---|
| Format: | Report |
| Published: |
Oxford University Computing Laboratory
2006
|