Algorithm modification of the level-by-level approximation to the minimum route.
N. D. StarostinK. V. MironovPublished in: ISSPIT (2017)
Keyphrases
- optimal solution
- experimental evaluation
- error bounds
- preprocessing
- np hard
- learning algorithm
- objective function
- computational complexity
- monte carlo
- improved algorithm
- high accuracy
- computational cost
- closed form
- matching algorithm
- detection algorithm
- optimization algorithm
- significant improvement
- global minimum
- scheduling problem
- data sets
- expectation maximization
- approximation ratio
- recognition algorithm
- k means
- approximation schemes
- decision trees
- error tolerance
- particle swarm optimization
- greedy algorithm
- randomized algorithm
- segmentation algorithm
- theoretical analysis
- higher level
- probabilistic model
- dynamic programming
- cost function
- search space
- genetic algorithm