| Article ID: | iaor20001720 |
| Country: | Germany |
| Volume: | 84 |
| Issue: | 3 |
| Start Page Number: | 483 |
| End Page Number: | 503 |
| Publication Date: | Jan 1999 |
| Journal: | Mathematical Programming |
| Authors: | Benczr A.A., Frank A. |
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.