A push-relabel framework for submodular function minimization and applications to parametric optimization

  title={A push-relabel framework for submodular function minimization and applications to parametric optimization},
  author={L. Fleischer and S. Iwata},
  journal={Discret. Appl. Math.},
Recently, the first combinatorial strongly polynomial algorithms for submodular function minimization have been devised independently by Iwata, Fleischer, and Fujishige and by Schrijver. In this paper, we improve the running time of Schrijver's algorithm by designing a push-relabel framework for submodular function minimization (SFM). We also extend this algorithm to carry out parametric minimization for a strong map sequence of submodular functions in the same asymptotic running time as a… Expand
Combinatorial strongly polynomial algorithms for minimizing submodular functions have been developed by Iwata, Fleischer, and Fujishige (IFF) and by Schrijver. The IFF algorithm employs a scalingExpand
A Faster Scaling Algorithm for Minimizing Submodular Functions
  • S. Iwata
  • Mathematics, Computer Science
  • IPCO
  • 2002
A faster combinatorial algorithm for submodular function minimization is proposed that improves over the previously best known bound by an almost linear factor in the size of the underlying ground set. Expand
Submodular function minimization and related topics
  • S. Fujishige
  • Mathematics, Computer Science
  • Optim. Methods Softw.
  • 2003
An outline of the IFF algorithm is given and two modifications of the original IFF algorithms seem to be promising in practical implementation and some possible future research subjects in submodular function minimization are furnished. Expand
Combinatorial Algorithms for Submodular Function Minimization and Related Problems
Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizesExpand
The Structure of Optimal Solutions to the Submodular Function Minimization Problem
Abstract : In this paper, we study the structure of optimal solutions to the submodular function minimization problem. We introduce prime sets and pseudoprime sets as basic building block ofExpand
A simple combinatorial algorithm for submodular function minimization
This is the first fully combinatorial submodular function minimization algorithm that does not rely on the scaling method and can be implemented in strongly polynomial time using only additions, subtractions, comparisons, and the oracle calls for function evaluation. Expand
Simple push-relabel algorithms for matroids and submodular flows
We derive simple push-relabel algorithms for the matroid partitioning, matroid membership, and submodular flow feasibility problems. It turns out that, in order to have a strongly polynomialExpand
Decomposable Submodular Function Minimization via Maximum Flow
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running timesExpand
A Submodular Function Minimization Algorithm Based on the Minimum-Norm Base ⁄
We consider an application of the minimum-norm-point algorithm to submodular function minimization. Although combinatorial polynomial algorithms for submodular function minimization (SFM) haveExpand
Efficient Minimization of Decomposable Submodular Functions
This paper develops an algorithm, SLG, that can efficiently minimize decomposable submodular functions with tens of thousands of variables, and applies it to synthetic benchmarks and a joint classification-and-segmentation task, and shows that it outperforms the state-of-the-art general purpose sub modular minimization algorithms by several orders of magnitude. Expand


A combinatorial strongly polynomial algorithm for minimizing submodular functions
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employsExpand
New algorithms for the intersection problem of submodular systems
We consider the problem of finding a maximum common subbase of two submodular systems onE with |E|=n. First, we present a new algorithm by finding the shortest augmenting paths, which begins with aExpand
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
The Gallo-Grigoriadis-Tarjan GGT method for parametric maximum flow problems is extended and an algorithmic significance of the concept of strong maps for submodular systems is revealed. Expand
On submodular function minimization
This work is extended to give a combinatorial algorithm for the problem of minimizing a submodular function, for which the amount of work is bounded by a polynomial in the size of the underlying set and the largest function value (not its length). Expand
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  • A. Schrijver
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method.Expand
The ellipsoid method and its consequences in combinatorial optimization
The method yields polynomial algorithms for vertex packing in perfect graphs, for the matching and matroid intersection problems, for optimum covering of directed cuts of a digraph, and for the minimum value of a submodular set function. Expand
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow, and shows that this algorithm needs to cancel only O(n3) cuts per scaling phase, where n is the number of nodes. Expand
A capacity scaling algorithm for convex cost submodular flows
  • S. Iwata
  • Mathematics, Computer Science
  • SODA '96
  • 1996
This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available. Expand
Minimizing a Submodular Function on a Lattice
This paper gives general conditions under which a collection of optimization problems, with the objective function and the constraint set depending on a parameter, has optimal solutions that are anExpand
A faster capacity scaling algorithm for minimum cost submodular flow
The algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem and is the first capacity scaling algorithms to match the current best strongly polynomial bound for sub modular flow. Expand