Which submodular functions are expressible using binary submodular functions?

Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been devised to minimise such functions. The time complexity of the fastest known general algorithm for submodular function minimisation (SFM) is O(n^6+n^5L), where n is the number...

Повний опис

Бібліографічні деталі
Автори: Živný, S, Jeavons, P
Формат: Report
Опубліковано: OUCL 2008