Pages that link to "Item:Q1300054"
From MaRDI portal
The following pages link to Covering symmetric supermodular functions by graphs (Q1300054):
Displaying 25 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (Q1013291) (← links)
- Covering skew-supermodular functions by hypergraphs of minimum total size (Q1038104) (← links)
- Minimal edge-coverings of pairs of sets (Q1898731) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- The even split rule for (concave) symmetric supermodular functions (Q2292771) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (Q2404617) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- Covering symmetric semi-monotone functions (Q2462361) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- A New Approach to Splitting-Off (Q3503862) (← links)
- (Q3617663) (← links)
- Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
- (Q5417727) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)
