A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius.
Nachshon CohenZeev NutovPublished in: APPROX-RANDOM (2011)
Keyphrases
- minimum cost
- approximation ratio
- np hard
- approximation algorithms
- network flow
- spanning tree
- tree structure
- computational complexity
- network flow problem
- linear programming
- worst case
- undirected graph
- dynamic programming
- optimal solution
- constant factor
- edit operations
- knapsack problem
- simulated annealing
- graph structure
- scheduling problem
- special case
- minimum cost flow