Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm.
Nicolas CatusseVictor ChepoiKarim NouiouaYann VaxèsPublished in: CoRR (2010)
Keyphrases
- optimization algorithm
- experimental evaluation
- times faster
- square error
- learning algorithm
- computational cost
- cost function
- np hard
- detection algorithm
- probabilistic model
- significant improvement
- optimal solution
- simulated annealing
- approximation ratio
- constant factor
- polynomial time approximation
- theoretical analysis
- input data
- linear programming
- dynamic programming
- high accuracy
- error bounds
- convergence rate
- global minimum
- search space
- computational complexity
- bayesian networks
- image sequences