A combinatorial algorithm for minimizing symmetric submodular functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 98-101

  Queyranne, Maurice ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

COMBINATORIAL ALGORITHM; FINITE SET; FUNCTION VALUES; MINIMUM CUT; SUBMODULAR FUNCTIONS; SUBMODULAR SET FUNCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 58149292093     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. C.K. Cheng and T.C.Hu, Maximum concurrent flows and minimum cuts, Algorithmica, 8 (1992), pp. 233249.
2. W.H. Cunningham, Decomposition of submodular functions, Combinatorica, 3 (1983), pp. 53-68.
3. L.E. Ford, Jr., and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
4. A. Frank, On the edge-connectivity algorithm of Nag-amochi and Ibaraki, Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble, March 1994.
5. S. Fujishige, Canonical decomposition of symmetric submodular systems, Discrete Applied Math., 5 (1983), pp. 175-190.
6. S. Fujishige, Submodular systems and related topics, Mathematical Programming Study, 22 (1984), pp. USISI.
7. S. Fujishige), Submodular Functions and Optimization, North-Holland, Amsterdam, The Netherlands, 1991.
8. M.X. Goemans and V.S. Ramakrishnan, Minimizing submodular functions over families of sets, Working Paper, Dept. of Mathematics, M.I.T., Cambridge, Mass., December 1993.
9. R.E. Gomory and T.C. Hu, Multiterminal network flows, J. Soc. Ind. Applied Math., 9 (1961), pp. 551570.
10. F. Granot, M. Penn and M. Queyranne, Disconnecting sets in single and two-terminal-pair networks, Working Paper, Faculty of Commerce, University of British Columbia, October 1993.
11. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, Germany, 1988.
12. R.P. Gupta, On flows in pseudosymmetric networks, J. Soc. Ind. Applied Math., 14 (1966), pp. 215-225.
13. J. Hao and J.B. Orlin, A faster algorithm for finding a minimum cut in a graph, Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (1992), pp. 165174.
14. L. Lovász, Submodular functions and convexity, in A. Bachem et al., eds, Mathematical Programming - The State of The Art, Springer, Berlin, Germany (1983), pp. 235-257.
15. H. Nagamochi and T. Ibaraki (1992), Linear time algorithms for finding a a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), pp. 583-596.
16. H. Nagamochi and T. Ibaraki, Computing edge connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, 5 (1992), pp. 54-66.
17. H. Nagamochi, T. Ono, and T. Ibaraki, Implementing an efficient minimum capacity cut algorithm, Technical Report #94011, Dept. of Applied Mathematics and Physics, University of Kyoto, Kyoto, Japan, June 1994.
18. M. Padberg and G. Rinaldi, An efficient algorithm for the minimum capacity cut problem, Mathematical Programming, 47 (1990), pp. 19-36.
19. M. Queyranne, A Gomory-Hu tree for symmetric sub-modular functions, unpublished manuscript, Faculty of Commerce, University of British Columbia, November 1993.
20. M. Stoer and F. Wagner, A simple min cut algorithm, to appear in the Proceedings of the 1994 European Symposium on Algorithms, 1994.
21. D.M. Topkis, Minimizing a submodular function on a lattice, Operations Research, 26 (1978), pp. 305-321.