An approximation algorithm for the traveling tournament problem.
Ryuhei MiyashiroTomomi MatsuiShinji ImahoriPublished in: Ann. Oper. Res. (2012)
Keyphrases
- learning algorithm
- data sets
- high accuracy
- computational cost
- dynamic programming
- recognition algorithm
- matching algorithm
- detection algorithm
- optimization algorithm
- segmentation algorithm
- np hard
- cost function
- selection algorithm
- worst case
- search space
- simulated annealing
- expectation maximization
- computationally efficient
- improved algorithm
- computational complexity
- randomized algorithm
- times faster
- error tolerance
- greedy algorithm
- error bounds
- polynomial time approximation
- theoretical analysis
- linear programming
- probabilistic model
- significant improvement
- preprocessing
- data streams
- objective function
- image segmentation