1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.
Piotr BermanMarek KarpinskiAlexander ZelikovskyPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- detection algorithm
- optimization algorithm
- experimental evaluation
- matching algorithm
- significant improvement
- high accuracy
- learning algorithm
- similarity measure
- computational complexity
- theoretical analysis
- dynamic programming
- times faster
- ant colony optimization
- distance function
- computationally efficient
- convergence rate
- recognition algorithm
- approximation ratio
- k means
- preprocessing
- optimal solution
- approximation algorithms
- closed form
- distance matrix
- neural network
- randomized algorithm
- clustering method
- expectation maximization
- linear programming
- worst case
- probabilistic model
- computational cost
- np hard
- cost function
- multi objective