An approximation algorithm for finding a long path in Hamiltonian graphs.
Sundar VishwanathanPublished in: SODA (2000)
Keyphrases
- detection algorithm
- error bounds
- learning algorithm
- k means
- optimization algorithm
- computational complexity
- significant improvement
- np hard
- theoretical analysis
- worst case
- graph model
- computational cost
- dynamic programming
- optimal solution
- similarity measure
- polynomial time approximation
- random graphs
- shortest path problem
- error tolerance
- optimal path
- recognition algorithm
- closed form
- segmentation algorithm
- np complete
- particle swarm optimization
- linear programming
- search space