An improved approximation algorithm for TSP in the half integral case.
Anna R. KarlinNathan KleinShayan Oveis GharanPublished in: STOC (2020)
Keyphrases
- np hard
- learning algorithm
- preprocessing
- high accuracy
- optimal solution
- search space
- particle swarm optimization
- times faster
- significant improvement
- cost function
- dynamic programming
- improved algorithm
- detection algorithm
- segmentation algorithm
- approximation ratio
- recognition algorithm
- special case
- computationally efficient
- expectation maximization
- neural network
- objective function
- theoretical analysis
- ant colony optimization
- classification algorithm
- matching algorithm
- feature selection
- error bounds
- computational cost
- experimental evaluation
- polynomial time approximation