Coverings and structure of crossing families

DOI10.1007/s101070050035zbMath0927.05060OpenAlexW2089777509MaRDI QIDQ1300055

Tamás Fleiner, Tibor Jordán

Publication date: 5 December 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050035

zbMATH Keywords

hypergraphssubmodular functionscovering problemaugmentation of connectivitycrossing families

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (5)

Minimum Cuts and Sparsification in Hypergraphs ⋮ Covering symmetric supermodular functions by uniform hypergraphs ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ 2-node-connectivity network design ⋮ 2-node-connectivity network design

This page was built for publication: Coverings and structure of crossing families