Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Mitre Costa DouradoDieter RautenbachVinícius Gusmão Pereira de SáJayme Luiz SzwarcfiterPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- computational complexity
- worst case
- np hard
- experimental evaluation
- dynamic programming
- computational effort
- significant improvement
- memory requirements
- space complexity
- preprocessing
- polynomial time complexity
- strongly polynomial
- approximation algorithms
- times faster
- matching algorithm
- approximation ratio
- learning algorithm
- randomized algorithm
- computational cost
- k means
- single scan
- optimization algorithm
- convergence rate
- convex hull
- detection algorithm
- small number
- probabilistic model
- special case
- optimal solution