Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Authors:
S. Thomas McCormick;Satoru Fujishige
Affiliations:
University of British Columbia, Vancouver, BC Canada;Kyoto University, Kyoto, Japan
Venue:
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2008

Citing 13
Cited 1

Directed submodularity, ditroids and directed submodular flows

Mathematical Programming: Series A and B
Pseudomatroids

Discrete Mathematics
On totally dual integral systems

Discrete Applied Mathematics
Signed posets

Journal of Combinatorial Theory Series A
A separation algorithm for the matchable set polytope

Mathematical Programming: Series A and B
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra

SIAM Journal on Discrete Mathematics
On structures of bisubmodular polyhedra

Mathematical Programming: Series A and B
A Min--Max Theorem for Bisubmodular Polyhedra

SIAM Journal on Discrete Mathematics
Discrete convex analysis

Mathematical Programming: Series A and B
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
A fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory Series B
Bisubmodular Function Minimization

SIAM Journal on Discrete Mathematics

A polynomial algorithm for weighted abstract flow

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function minimization (SFM) to bisubmodular function minimization (BSFM). However, they were able to extend only the weakly polynomial version of IFF to BSFM. Here we investigate the difficulty that prevented them from also extending the strongly polynomial version of IFF to BSFM, and we show a way around the difficulty. This new method gives the first combinatorial strongly polynomial algorithm for BSFM. This further leads to extending Iwata's fully combinatorial version of IFF to BSFM.