A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size.
Krzysztof OnakDana RonMichal RosenRonitt RubinfeldPublished in: SODA (2012)
Keyphrases
- preprocessing
- experimental evaluation
- objective function
- scales linearly
- computational complexity
- cost function
- detection algorithm
- dynamic programming
- worst case time complexity
- recognition algorithm
- space complexity
- window size
- learning algorithm
- k means
- np hard
- similarity measure
- improved algorithm
- high accuracy
- linear programming
- classification algorithm
- segmentation algorithm
- clustering method
- fixed size
- standard deviation
- worst case
- tree structure
- theoretical analysis
- simulated annealing
- data sets
- computational cost
- significant improvement
- evolutionary algorithm
- search space
- clustering algorithm
- neural network