The following pages link to (Q2921668):
Displaying 9 items.
- 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)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (Q1013291) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
