On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem.
Lawrence T. KouPublished in: Acta Informatica (1990)
Keyphrases
- efficient implementation
- active set
- search space
- hardware implementation
- detection algorithm
- learning algorithm
- approximation ratio
- expectation maximization
- objective function
- preprocessing
- np hard
- dynamic programming
- computational cost
- worst case
- simulated annealing
- polygonal approximation
- approximation algorithms
- matching algorithm
- neural network
- cost function
- minimum spanning tree
- semidefinite programming
- computational complexity
- lower bound
- optimization algorithm
- k means
- particle swarm optimization
- linear programming
- motion estimation
- probabilistic model