Pages that link to "Item:Q3910552"
From MaRDI portal
The following pages link to Approximation Algorithms for Several Graph Augmentation Problems (Q3910552):
Displaying 16 items.
- The capacitated m two node survivable star problem (Q4987700) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- (Q5111750) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
