A rounding algorithm for approximating minimum Manhattan networks.
Victor ChepoiKarim NouiouaYann VaxèsPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- learning algorithm
- dynamic programming
- linear programming
- improved algorithm
- cost function
- experimental evaluation
- high accuracy
- detection algorithm
- computational cost
- computationally efficient
- expectation maximization
- square error
- optimization algorithm
- theoretical analysis
- simulated annealing
- preprocessing
- data sets
- input data
- search space
- worst case
- segmentation algorithm
- probabilistic model
- computational complexity
- path planning
- convex hull
- recognition algorithm
- objective function
- fully connected