1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Piotr BermanMarek KarpinskiAlexander ZelikovskyPublished in: CoRR (2008)
Keyphrases
- optimization algorithm
- cost function
- matching algorithm
- k means
- segmentation algorithm
- experimental evaluation
- learning algorithm
- recognition algorithm
- error bounds
- np hard
- particle swarm optimization
- worst case
- linear programming
- polynomial time approximation
- closed form
- computational cost
- dynamic programming
- significant improvement
- computational complexity
- objective function
- feature selection
- nearest neighbor
- approximation ratio
- approximation methods
- improved algorithm
- similarity measure
- approximation algorithms
- times faster
- optimal solution
- detection algorithm
- evolutionary algorithm
- computationally efficient
- input data