Covering symmetric supermodular functions by uniform hypergraphs

Authors:
Tamás Király
Affiliations:
MTA-ELTE Egerváry Research Group on Combinatorial Optimization, Department of Operations Research, Eötvös University, Pázmány Péter sét´ny 1/C, Budapest H-1 ...
Venue:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 1
Cited 1

Edge-connectivity augmentation problems

Journal of Computer and System Sciences

Note: Local edge-connectivity augmentation in hypergraphs is NP-complete

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding a uniform hypergraph that satisfies cut demands defined by a symmetric crossing supermodular set function. We give min-max formulas for both the degree specified and the minimum cardinality problem. These results include as a special case a formula on the minimum number of r-hyperedges whose addition to an initial hypergraph will make it k-edge-connected.