4 search results - page 1 / 1 » Strongly polynomial and fully combinatorial algorithms for b... |
SODA
2008
ACM
13 years 5 months ago
2008
ACM
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
IPCO
2001
13 years 5 months ago
2001
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
JCT
2000
13 years 4 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...