4 search results - page 1 / 1 » Strongly polynomial and fully combinatorial algorithms for b... |
126
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
92
Voted
IPCO
2001
15 years 1 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 ...
101
click to vote
JCT
2000
15 years 10 days 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 ...
90
Voted
CORR
2010
Springer
15 years 19 days 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...