A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size
Krzysztof OnakDana RonMichal RosenRonitt RubinfeldPublished in: CoRR (2011)
Keyphrases
- learning algorithm
- linear programming
- estimation algorithm
- k means
- computational complexity
- dynamic programming
- experimental evaluation
- detection algorithm
- selection algorithm
- improved algorithm
- fixed size
- np hard
- computational cost
- high accuracy
- space complexity
- similarity measure
- recognition algorithm
- convergence rate
- matching algorithm
- optimization algorithm
- computationally efficient
- worst case
- objective function
- preprocessing
- optimal solution
- brute force
- search algorithm
- optimal or near optimal
- standard deviation
- times faster
- path planning
- theoretical analysis
- neural network
- simulated annealing
- significant improvement
- lower bound