论文信息 - Covering symmetric supermodular functions by graphs

Covering symmetric supermodular functions by graphs

The minimum number of edges of an undirected graph covering a symmetric, supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation.

András Frank | András A. Benczúr

[1] Akira Nakamura,et al. Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[2] Eddie Cheng. Edge-augmentation of hypergraphs , 1999, Math. Program..

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

[4] Jørgen Bang-Jensen,et al. Augmenting hypergraphs by edges of size two , 1999, Math. Program..

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

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

[7] Zoltán Szigeti. Hypergraph connectivity augmentation , 1999, Math. Program..