A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem.
Christoph HunkenschröderSantosh S. VempalaAdrian VettaPublished in: ACM Trans. Algorithms (2019)
Keyphrases
- computational cost
- detection algorithm
- search space
- preprocessing
- simulated annealing
- dynamic programming
- np hard
- linear programming
- objective function
- experimental evaluation
- convex hull
- convergence rate
- learning algorithm
- optimization algorithm
- theoretical analysis
- matching algorithm
- closed form
- probabilistic model
- significant improvement
- computational complexity
- optimal solution
- neural network
- expectation maximization
- k means
- search algorithm
- similarity measure
- image sequences
- recognition algorithm