The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound.
Jingyang ZhaoMingyu XiaoPublished in: IJCAI (2021)
Keyphrases
- worst case
- high accuracy
- search space
- k means
- computational cost
- learning algorithm
- detection algorithm
- cost function
- approximation ratio
- times faster
- np hard
- genetic algorithm
- total length
- theoretical analysis
- expectation maximization
- real world
- preprocessing
- objective function
- optimal solution
- similarity measure
- error bounds
- optimization algorithm
- computational complexity
- particle swarm optimization
- significant improvement
- multi objective
- search algorithm
- segmentation algorithm
- input data
- dynamic programming
- clustering method
- linear programming
- traveling salesman problem
- simulated annealing
- approximation algorithms
- recognition algorithm
- randomized algorithm
- minimum length
- polynomial time approximation