Bisubmodular Function Minimization

Authors:
Satoru Fujishige;Satoru Iwata
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 7

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

Theoretical Computer Science
Even factors, jump systems, and discrete convexity

Journal of Combinatorial Theory Series B
Submodularity on a tree: unifying L-convex and bisubmodular functions

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Generalized roof duality and bisubmodular functions

Discrete Applied Mathematics
Generalized roof duality

Discrete Applied Mathematics
Towards minimizing k-submodular functions

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.