Corpus ID: 10503773

A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗

@inproceedings{SIAMJ2001AFS,
  title={A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗},
  author={C SIAMJ.},
  year={2001}
}
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 scaling scheme for submodular functions, whereas Schrijver’s algorithm achieves strongly polynomial bound with the aid of distance labeling. Subsequently, Fleischer and Iwata have described a push/relabel version of Schrijver’s algorithm to improve its time complexity. This paper combines the scaling scheme… Expand
A simple combinatorial algorithm for submodular function minimization
TLDR
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
Submodular function minimization and related topics
  • S. Fujishige
  • Mathematics, Computer Science
  • Optim. Methods Softw.
  • 2003
TLDR
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
A faster strongly polynomial time algorithm for submodular function minimization
  • J. Orlin
  • Mathematics, Computer Science
  • Math. Program.
  • 2009
TLDR
A combinatorial algorithm that runs in O(n5EO  +  n6) time, where EO is the time to evaluate f(S) for some submodular function f defined on a set V with n elements is given. Expand
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
TLDR
This work investigates the difficulty that prevented the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function minimization (SFM) from also extending the strongly polynomial version of IFF to BSFM, and shows a way around the difficulty. Expand
On the Convergence Rate of Decomposable Submodular Function Minimization
TLDR
It is shown that the algorithm converges linearly, and the upper and lower bounds on the rate of convergence are provided, which relies on the geometry of submodular polyhedra and draws on results from spectral graph theory. Expand
Geometric Rescaling Algorithms for Submodular Function Minimization
TLDR
A new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain stronglyPolynomial SFM algorithms, which can be applied to a wide range of combinatorial and continuous algorithms, including pseudo-polynomial ones. Expand
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
Algorithms and Lower Bounds for Submodular Cuts and Approximating Submodular Functions (Combinatorial Optimization and Discrete Algorithms)
TLDR
An algorithm for approximating monotone submodular functions with special structure, called two-partition functions is presented, which’s guarantee is close to the lower bound, which uses two- partition functions, and therefore applies even in this special case. Expand
A lower bound for parallel submodular minimization
TLDR
This paper gives the first non-trivial lower bound for the parallel runtime of submodular minimization, and shows that there is no o(logn/loglogn)-adaptive algorithm with poly(n) queries which solves the problem of sub MODULAR minimization. Expand
Submodular Functions: Optimization and Approximation
Submodular functions are discrete analogue of convex functions, arising in various fields of applied mathematics including game theory, information theory, and queueing theory. This survey aims atExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
A push-relabel framework for submodular function minimization and applications to parametric optimization
TLDR
This paper improves the running time of Schrijver's algorithm by designing a push-relabel framework for submodular function minimization (SFM), and extends this algorithm to carry out parametric minimization for a strong map sequence of sub modular functions in the same asymptotic running time as a single SFM. 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
Improved algorithms for submodular function minimization and submodular flow
TLDR
This work improves the complexity of Schrijver's algorithm by designing a push-relabel algorithm for submodular function minimization (SFM), shows that optimal dual solutions can be computed in the same time as SFM, and that optimal primal solutions can thus be obtained with one additional maximum sub modular flow computation. 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
TLDR
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 capacity scaling algorithm for convex cost submodular flows
  • S. Iwata
  • Mathematics, Computer Science
  • SODA '96
  • 1996
TLDR
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
Testing membership in matroid polyhedra
  • W. Cunningham
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1984
TLDR
An algorithm is described for solving this problem for which the amount of computation is bounded by a polynomial in E, independently of x, allowing as steps tests of independence in M and additions, subtractions, and comparisons of numbers. Expand
A fully combinatorial algorithm for submodular function minimization
  • S. Iwata
  • Computer Science, Mathematics
  • SODA '02
  • 2002
This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.
Submodular functions and optimization
Introduction. 1. Mathematical Preliminaries. Submodular Systems and Base Polyhedra. 2. From Matroids to Submodular Systems. Matroids. Polymatroids. Submodular Systems. 3. Submodular Systems and BaseExpand
Submodular functions and convexity
TLDR
In “continuous” optimization convex functions play a central role, and linear programming may be viewed as the optimization of very special (linear) objective functions over very special convex domains (polyhedra). Expand
...
1
2
...