Minimizing symmetric submodular functions

We describe a purely combinatorial algorithm which, given a submodular set functionf on a finite setV, finds a nontrivial subsetA ofV minimizingf[A] + f[V ∖ A]. This algorithm, an extension of the Nagamochi—Ibaraki minimum cut algorithm as simplified by Stoer and Wagner [M. Stoer, F. Wagner, A simple min cut algorithm, Proceedings of the European Symposium on Algorithms ESA '94, LNCS 855, Springer, Berlin, 1994, pp. 141–147] and by Frank [A. Frank, On the edge-connectivity algorithm of Nagamochi and Ibaraki, Laboratoire Artémis, IMAG, Université J. Fourier, Grenbole, 1994], minimizes any symmetric submodular function using O(|V|3) calls to a function value oracle. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

[1]  William H. Cunningham.  On submodular function minimization , 1985, Comb..

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

[3]  David P. Williamson,et al.  An efficient approximation algorithm for the survivable network design problem , 1998, Math. Program..

[4]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[5]  Ram Prakash Gupta.  On Flows in Pseudosymmetric Networks , 1966 .

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

[7]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[8]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

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

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

[11]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[12]  Mechthild Stoer,et al.  A Simple Min Cut Algorithm , 1994, ESA.

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

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

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

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

[17]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[19]  H. Narayanan.  Submodular functions and electrical networks , 1997 .

[20]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[21]  Michel X. Goemans,et al.  Minimizing submodular functions over families of sets , 1995, Comb..

[22]  Francisco Barahona,et al.  Separating from the dominant of the spanning tree polytope , 1992, Oper. Res. Lett..

[23]  Ashok Subramanian,et al.  Two recent algorithms for the global minimum cut problem , 1995, SIGA.

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

[25]  Maurice Queyranne,et al.  A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.