A Simple, Fast and Near Optimal Approximation Algorithm for Optimization of Un-Weighted Minimum Vertex Cover.
Muhammad FayazShakeel ArshadUmar ZamanAkhlaque AhmadPublished in: FIT (2016)
Keyphrases
- optimization algorithm
- learning algorithm
- optimization method
- detection algorithm
- np hard
- optimization process
- times faster
- high accuracy
- dynamic programming
- computational cost
- preprocessing
- optimal solution
- clustering method
- significant improvement
- monte carlo
- search space
- theoretical analysis
- expectation maximization
- optimization model
- optimization problems
- error bounds
- worst case
- weight function
- cost function
- constrained optimization
- evolution strategy
- efficient computation
- monte carlo sampling
- polynomial time approximation
- neural network
- convergence rate
- convex hull
- particle swarm optimization
- simulated annealing
- experimental evaluation
- k means
- genetic algorithm