Pages that link to "Item:Q4962187"
From MaRDI portal
The following pages link to Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation (Q4962187):
Displaying 11 items.
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)