A 5/4-approximation algorithm for minimum 2-edge-connectivity.
Raja JothiBalaji RaghavachariSubramanian VaradarajanPublished in: SODA (2003)
Keyphrases
- learning algorithm
- dynamic programming
- error bounds
- computational complexity
- significant improvement
- objective function
- worst case
- experimental evaluation
- high accuracy
- preprocessing
- k means
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- randomized algorithm
- weighted graph
- similarity measure
- detection algorithm
- np hard
- cost function
- search space
- optimal solution
- linear programming
- computational cost
- times faster
- greedy algorithm
- approximation ratio
- square error