Applications of submodular functions

Submodular functions and related polyhedra play an increasing role in combinatorial optimization. The present survey-type paper is intended to provide a brief account of this theory along with several applications in graph theory and combinatorial optimization.

[1]  C. Nash-Williams.  On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.

[2]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

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

[4]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[5]  B. Rothschild,et al.  Feasibility of Two Commodity Network Flows , 1966, Oper. Res..

[6]  D. R. Fulkerson,et al.  Minimal k-arc connected graphs , 1971, Networks.

[7]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[8]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

[9]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[10]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[11]  Krishnamurthy Vidyasankar.  Covering the edge set of a directed graph with trees , 1978, Discret. Math..

[12]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[13]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[14]  Yossi Shiloach,et al.  Edge-Disjoint Branching in Directed Multigraphs , 1979, Inf. Process. Lett..

[15]  F. Boesch,et al.  ROBBINS'S THEOREM FOR MIXED MULTIGRAPHS , 1980 .

[16]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[17]  András Frank,et al.  How to make a digraph strongly connected , 1981, Comb..

[18]  Wolfgang Mader,et al.  Konstruktion aller n-fach kantenzusammenhängenden Digraphen , 1982, Eur. J. Comb..

[19]  Mao-Cheng Cai.  Arc-disjoint arborescences of digraphs , 1983, J. Graph Theory.

[20]  Satoru Fujishige,et al.  Structures of polyhedra determined by submodular functions on crossing families , 1984, Math. Program..

[21]  András Frank,et al.  A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..

[22]  Yoji Kajitani,et al.  The minimum augmentation of a directed tree to a k-edge-connected directed graph , 1986, Networks.

[23]  András Frank,et al.  On Connectivity Properties of Eulerian Digraphs , 1988 .

[24]  A. Frank,et al.  An application of submodular flows , 1989 .

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

[26]  András Frank.  Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[27]  András Frank,et al.  On a theorem of Mader , 1992, Discret. Math..

[28]  András Frank,et al.  Submodular functions in graph theory , 1993, Discret. Math..

[29]  MATTHIAS MIDDENDORF,et al.  On the complexity of the disjoint paths problem , 1993, Comb..

[30]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[31]  András Frank,et al.  Preserving and Increasing Local Edge-Connectivity in Mixed Graphs , 1995, SIAM J. Discret. Math..

[32]  J. Edmonds.  Matroid Intersection , 2022 .