A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem.
Cristina G. FernandesPublished in: SODA (1997)
Keyphrases
- approximation ratio
- np hard
- minimum cost
- approximation algorithms
- special case
- disjoint paths
- search algorithm
- greedy algorithm
- undirected graph
- approximately optimal
- edge detection
- constant factor
- worst case
- graph mining
- spanning tree
- edge information
- integer programming
- greedy algorithms
- approximation guarantees
- neural network
- weighted graph
- edge detector
- edge weights
- multiple scales
- connected components
- linear programming
- optimal solution
- square error
- edge direction
- multiscale