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