An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.
Benjamin E. BirnbaumKenneth J. GoldmanPublished in: APPROX-RANDOM (2006)
Keyphrases
- dynamic programming
- objective function
- high accuracy
- learning algorithm
- times faster
- computational complexity
- experimental evaluation
- computational cost
- optimization algorithm
- expectation maximization
- search space
- k means
- cost function
- simulated annealing
- detection algorithm
- greedy algorithm
- linear programming
- np hard
- selection algorithm
- globally optimal
- real time
- greedy strategy
- path planning
- theoretical analysis
- particle swarm optimization
- preprocessing
- search algorithm
- genetic algorithm