Bisubmodular Function Minimization

Authors:
Satoru Fujishige;Satoru Iwata
Affiliations:
-;-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 12
Cited 0

On submodular function minimization

Combinatorica
An application of simultaneous Diophantine approximation in combinatorial optimization

Combinatorica
Greedy algorithm and symmetric matroids

Mathematical Programming: Series A and B
Directed submodularity, ditroids and directed submodular flows

Mathematical Programming: Series A and B
Pseudomatroids

Discrete Mathematics
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
The membership problem in jump systems

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the first combinatorial, polynomial-time algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. A bisubmodular function arises as a rank function of a delta-matroid. The scaling algorithm naturally leads to the first combinatorial polynomial-time algorithm for testing membership in delta-matroid polyhedra. Unlike the case of matroid polyhedra, it remains open to develop a combinatorial strongly polynomial algorithm for this problem.