Sciweavers

IPCO
2001

Bisubmodular Function Minimization

13 years 7 months ago
Bisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matroid polyhedra. Key words. bisubmodular function, delta-matroid, scaling algorithm AMS subject classification. 90C27 DOI. 10.1137/S0895480103426339
Satoru Fujishige, Satoru Iwata
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IPCO
Authors Satoru Fujishige, Satoru Iwata
Comments (0)