Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm.
Endre BorosAndrás RecskiTibor SzkaliczkiFerenc WettlPublished in: Comput. Artif. Intell. (1999)
Keyphrases
- detection algorithm
- learning algorithm
- times faster
- objective function
- optimal solution
- np hard
- optimization algorithm
- worst case
- k means
- improved algorithm
- computational complexity
- linear programming
- special case
- cost function
- dynamic programming
- experimental evaluation
- similarity measure
- approximation ratio
- strongly polynomial
- theoretical analysis
- expectation maximization
- high accuracy
- clustering method
- ant colony optimization
- computational cost
- clustering algorithm
- neural network