A Rounding Algorithm for Approximating Minimum Manhattan Networks.
Victor ChepoiKarim NouiouaYann VaxèsPublished in: APPROX-RANDOM (2005)
Keyphrases
- learning algorithm
- detection algorithm
- genetic algorithm
- preprocessing
- improved algorithm
- computational complexity
- cost function
- experimental evaluation
- probabilistic model
- neural network
- k means
- dynamic programming
- square error
- times faster
- matching algorithm
- optimization algorithm
- worst case
- optimal solution
- objective function
- expectation maximization
- segmentation algorithm
- particle swarm optimization
- clustering method
- energy function
- ant colony optimization
- np hard
- artificial neural networks
- feasible solution
- knapsack problem
- recognition algorithm
- minimum length