Minimizing a sum of submodular functions

Details Minimizing a sum of submodular functions Minimizing a sum of submodular functions

2010-06-10

arxiv.org/abs/1006.1990v1

Computer Science

Data Structures and Algorithms

18 pages

Scientific paper

We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of {\em exchange capacities}. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a {\em submodular flow} (SF) problem in an auxiliary graph, and show that applying most existing SF algorithms would rely only on these subroutines. We then explore in more detail Iwata's capacity scaling approach for submodular flows (Math. Programming, 76(2):299--308, 1997). In particular, we show how to improve its complexity in the case when the function contains cardinality-dependent terms.

Affiliated with

Also associated with

No associations

Rating

Minimizing a sum of submodular functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing a sum of submodular functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing a sum of submodular functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491995