Abstract
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 1996 / Revised version received January 1998 Published online March 16, 1999
Rights and permissions
About this article
Cite this article
Benczúr, A., Frank, A. Covering symmetric supermodular functions by graphs. Math. Program. 84, 483–503 (1999). https://doi.org/10.1007/s101070050034
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070050034