A note on the minimization of symmetric and general submodular functions

Authors:
H. Narayanan
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology, Bombay, Mumbai 400 076, India
Venue:
Discrete Applied Mathematics - Submodularity
Year:
2003

Citing 7
Cited 5

Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
Implementing an efficient minimum capacity cut algorithm

Mathematical Programming: Series A and B
A simple min-cut algorithm

Journal of the ACM (JACM)
A note on minimizing submodular functions

Information Processing Letters
A combinatorial algorithm for minimizing symmetric submodular functions

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B

Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

Theoretical Computer Science
Speech separation by efficient combinatorial decoding of speech mixtures

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
The complexity of valued constraint models

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An algebraic characterisation of complexity for valued constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Source location in undirected and directed hypergraphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we relate the minimization problems for general submodular functions and symmetric submodular functions. We characterize the contractions and restrictions of symmetric submodular functions. The latter we show to be the same as posimodular functions. Finally, we prove the equivalence of various symmetric submodular function minimization problems and the general submodular function minimization problem. We also give a preprocessing algorithm for the general submodular function minimization problem which could lead to substantial size reduction.