A novel parameterised approximation algorithm for minimum vertex cover.
Ljiljana BrankovicHenning FernauPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- high accuracy
- computational complexity
- np hard
- error bounds
- optimal solution
- preprocessing
- computationally efficient
- approximation ratio
- genetic algorithm
- worst case
- computational cost
- improved algorithm
- objective function
- convex hull
- theoretical analysis
- tree structure
- closed form
- dynamic programming
- recognition algorithm
- k means
- polygonal approximation
- times faster
- simulated annealing
- monte carlo
- segmentation algorithm
- expectation maximization
- linear programming
- significant improvement
- search algorithm
- clustering algorithm
- learning algorithm