A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3.
Hans Jürgen PrömelAngelika StegerPublished in: J. Algorithms (2000)
Keyphrases
- learning algorithm
- cost function
- significant improvement
- k means
- computational cost
- data sets
- simulated annealing
- worst case
- standard deviation
- optimal solution
- objective function
- times faster
- matching algorithm
- monte carlo
- clustering method
- detection algorithm
- recognition algorithm
- improved algorithm
- polynomial time approximation
- optimization algorithm
- theoretical analysis
- input data
- experimental evaluation
- dynamic programming
- np hard
- search space
- closed form
- preprocessing
- error bounds
- computational complexity
- similarity measure
- genetic algorithm
- minimum spanning tree
- neural network