An Approximation Algorithm for the Bipartite Traveling Tournament Problem.
Richard HoshinoKen-ichi KawarabayashiPublished in: Math. Oper. Res. (2013)
Keyphrases
- k means
- cost function
- computational complexity
- search space
- improved algorithm
- dynamic programming
- recognition algorithm
- computational cost
- particle swarm optimization
- optimal solution
- significant improvement
- polynomial time approximation
- genetic algorithm
- times faster
- clustering method
- detection algorithm
- theoretical analysis
- high accuracy
- np hard
- optimization algorithm
- graph cuts
- expectation maximization
- ant colony optimization
- convergence rate
- real valued
- experimental evaluation
- approximation ratio
- preprocessing