A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
Hiroshi NagamochiKohei OkadaPublished in: Discret. Appl. Math. (2004)
Keyphrases
- tree structure
- computational complexity
- computational cost
- times faster
- objective function
- high accuracy
- significant improvement
- search space
- expectation maximization
- preprocessing
- detection algorithm
- dynamic programming
- highly efficient
- segmentation algorithm
- closed form
- probabilistic model
- error bounds
- np hard
- cost function
- multi objective
- k means
- binary tree
- polygonal approximation
- computationally demanding
- neural network
- minimum spanning tree
- suffix tree
- polynomial time approximation
- spanning tree
- convergence rate
- optimization algorithm
- simulated annealing
- worst case
- experimental evaluation
- data structure
- optimal solution
- learning algorithm
- genetic algorithm