Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem.
Andrzej LingasAgnieszka WasylewiczPawel ZylinskiPublished in: Int. J. Comput. Geom. Appl. (2012)
Keyphrases
- worst case
- detection algorithm
- high accuracy
- significant improvement
- times faster
- cost function
- closed form
- error bounds
- simulated annealing
- preprocessing
- learning algorithm
- experimental evaluation
- improved algorithm
- dynamic programming
- optimal solution
- segmentation algorithm
- optimization algorithm
- tree structure
- matching algorithm
- convergence rate
- neural network
- approximation ratio
- path planning
- theoretical analysis
- particle swarm optimization
- np hard
- search space
- computational complexity