1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2.
Piotr BermanMarek KarpinskiAlexander ZelikovskyPublished in: WADS (2009)
Keyphrases
- experimental evaluation
- detection algorithm
- dynamic programming
- computational cost
- matching algorithm
- high accuracy
- preprocessing
- computationally efficient
- learning algorithm
- cost function
- search space
- times faster
- k means
- optimal solution
- simulated annealing
- linear programming
- closed form
- theoretical analysis
- optimization algorithm
- improved algorithm
- distance function
- clustering method
- particle swarm optimization
- significant improvement
- objective function