论文信息 - NOTE – On Minimizing Symmetric Set Functions

NOTE – On Minimizing Symmetric Set Functions

u, v) of nodes such that the star of v is a minimum cut separating u and v. Nagamochi and Ibaraki showed that the last two nodes of a ``max-back order'' form such a pair and used this fact to develop an elegant min-cut algorithm. M. Queyranne extended this approach to minimize symmetric submodular functions. With the help of a short and simple proof, here we show that the same algorithm works for an even more general class of set functions.

Romeo Rizzi

[1] W. Mader. über minimaln-fach zusammenhängende, unendliche Graphen und ein Extremalproblem , 1972 .

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

[3] Satoru Fujishige,et al. ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION , 1998 .

[4] Toshihide Ibaraki,et al. A Note on Minimizing Submodular Functions , 1998, Inf. Process. Lett..

[5] Frank Wagner,et al. A simple hypergraph min cut algorithm , 1996 .

[6] Maurice Queyranne,et al. Minimizing symmetric submodular functions , 1998, Math. Program..

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