Covering symmetric supermodular functions by uniform hypergraphs

DOI10.1016/J.JCTB.2003.12.004MaRDI QIDQ598465zbMATH OpenOpenAlexFDO

Authors Tamás Király

Publication date 6 August 2004

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2003.12.004

zbMATH Keywords

Connectivity augmentationHypergraphsSupermodularity

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Covering symmetric supermodular functions by graphs
• Minimal edge-coverings of pairs of sets
• A unifying approach to splitting-off
• scientific article; zbMATH DE number 6297806
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph

Cites work

• Augmenting hypergraphs by edges of size two
• Covering symmetric supermodular functions by graphs
• Coverings and structure of crossing families
• Edge-augmentation of hypergraphs
• Edge-connectivity augmentation problems
• Hypergraph connectivity augmentation

Cited in

(16)

• Covering skew-supermodular functions by hypergraphs of minimum total size
• Covering symmetric supermodular functions by graphs
• Minimal edge-coverings of pairs of sets
• The even split rule for (concave) symmetric supermodular functions
• Testing the supermodular-cut condition
• Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank
• A unifying approach to splitting-off
• Realizing symmetric set functions as hypergraph cut capacity
• The generalized terminal backup problem
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
• A Survey on Covering Supermodular Functions
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• scientific article; zbMATH DE number 5535214 (Why is no real title available?)
• scientific article; zbMATH DE number 6297806 (Why is no real title available?)
• Covering complete hypergraphs with cuts of minimum total size
• Local edge-connectivity augmentation in hypergraphs is NP-complete

This page was built for publication: Covering symmetric supermodular functions by uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598465)