A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.
Yefim DinitzZeev NutovPublished in: J. Algorithms (1999)
Keyphrases
- computational complexity
- dynamic programming
- detection algorithm
- matching algorithm
- k means
- cost function
- significant improvement
- theoretical analysis
- experimental evaluation
- times faster
- preprocessing
- similarity measure
- approximation ratio
- error bounds
- closed form
- convergence rate
- learning algorithm
- high accuracy
- np hard
- optimal solution
- expectation maximization
- worst case
- computational cost
- directed graph
- search space
- objective function