An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem.
Ehsan Najafi YazdiAlireza BagheriZahra MoezkarimiHamidreza KeshavarzPublished in: Inf. Process. Lett. (2015)
Keyphrases
- objective function
- computational complexity
- preprocessing
- detection algorithm
- cost function
- computational cost
- matching algorithm
- worst case
- dynamic programming
- experimental evaluation
- error bounds
- convex hull
- optimization algorithm
- learning algorithm
- np hard
- special case
- geometric constraints
- simulated annealing
- improved algorithm
- k means
- monte carlo
- optimal solution
- times faster
- polynomial time approximation
- dimensional data
- recognition algorithm
- neural network
- ant colony optimization
- computationally efficient
- high accuracy
- search space
- keywords