Pages that link to "Item:Q5740195"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195):
Displaying 8 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems (Q3125225) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation (Q4962187) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)