Pages that link to "Item:Q5204328"
From MaRDI portal
The following pages link to Approximation algorithms for graph augmentation (Q5204328):
Displaying 7 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Approximation Algorithms for Graph Augmentation (Q4033765) (← links)