An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem.
Anna R. KarlinNathan KleinShayan Oveis GharanXinzhi ZhangPublished in: CoRR (2021)
Keyphrases
- detection algorithm
- significant improvement
- cost function
- learning algorithm
- computational complexity
- np hard
- experimental evaluation
- edge detection
- recognition algorithm
- closed form
- theoretical analysis
- worst case
- optimal solution
- computational cost
- approximation ratio
- expectation maximization
- energy function
- search space
- square error
- probabilistic model
- gradient information
- graph structure
- error bounds
- matching algorithm
- tree structure
- k means
- dynamic programming
- simulated annealing
- genetic algorithm
- high accuracy