Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphismsa
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...
| Главные авторы: | , , |
|---|---|
| Формат: | Journal article |
| Язык: | English |
| Опубликовано: |
Elsevier
2008
|