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...
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Journal article |
| Foilsithe / Cruthaithe: |
2008
|
Search Result 1
Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms
Foilsithe / Cruthaithe 2006
Report