论文信息 - A combinatorial algorithm for minimizing symmetric submodular functions

A combinatorial algorithm for minimizing symmetric submodular functions

We describe a purely combinatorial algorithm which, given a submodular set function f on a finite set V, finds a proper subset A of V minimizing f[A]+f[V\A]. This algorithm, an extension of the Nagamochi-Ibaraki minimum cut algorithm as simplified by Stoer and Wagner (1994) and by F’rank (1994), minimizes any symmetric submodular function using O(lVl”) calls to a function value oracle.

Maurice Queyranne | M. Queyranne

[1] 藤重悟. Submodular functions and optimization , 1991 .

[2] Giovanni Rinaldi,et al. An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[3] Satoru Fujishige. Canonical decompositions of symmetric submodular systems , 1983, Discret. Appl. Math..

[4] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[5] William H. Cunningham,et al. Decomposition of submodular functions , 1983, Comb..

[6] Mechthild Stoer,et al. A simple min-cut algorithm , 1997, JACM.

[7] James B. Orlin,et al. A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.

[8] Toshihide Ibaraki,et al. Implementing an efficient minimum capacity cut algorithm , 1994, Math. Program..

[9] S. Fujishige. Submodular systems and related topics , 1984 .

[10] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .

[11] Donald M. Topkis,et al. Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..

[12] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[13] Maurice Queyranne,et al. Disconnecting sets in single and two‐terminal‐pair networks , 1996 .

[14] Martin Grötschel,et al. Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.