A 2.75-approximation algorithm for the unconstrained traveling tournament problem.
Shinji ImahoriTomomi MatsuiRyuhei MiyashiroPublished in: Ann. Oper. Res. (2014)
Keyphrases
- experimental evaluation
- learning algorithm
- computational cost
- improved algorithm
- optimization algorithm
- np hard
- optimal solution
- worst case
- k means
- special case
- recognition algorithm
- dynamic programming
- times faster
- detection algorithm
- high accuracy
- objective function
- segmentation algorithm
- theoretical analysis
- neural network
- video sequences
- tree structure
- expectation maximization
- simulated annealing
- probabilistic model
- data sets
- mobile robot
- cost function
- computational complexity