Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard.
Levent TunçelPublished in: Math. Program. (1999)
Keyphrases
- np hard
- worst case
- computational complexity
- optimal solution
- detection algorithm
- dynamic programming
- linear programming
- np hardness
- cost function
- experimental evaluation
- computational cost
- memory requirements
- ant colony optimization
- theoretical analysis
- k means
- learning algorithm
- probabilistic model
- improved algorithm
- similarity measure
- preprocessing
- particle swarm optimization
- approximation ratio
- approximation algorithms
- computationally efficient
- np complete
- space complexity
- linear complexity
- greedy heuristic
- high accuracy
- significant improvement
- parametric curves
- convex hull
- times faster
- decision problems
- graph cuts
- input data
- simulated annealing
- scheduling problem
- special case
- search space