A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs.
Pere GuitartPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- detection algorithm
- search space
- dynamic programming
- learning algorithm
- parallel implementation
- objective function
- recognition algorithm
- preprocessing
- times faster
- graph isomorphism
- theoretical analysis
- particle swarm optimization
- cost function
- k means
- computational complexity
- experimental evaluation
- np hard
- optimization algorithm
- significant improvement
- closed form
- error bounds
- convergence rate
- approximation algorithms
- bayesian networks
- memory efficient
- approximation ratio
- subgraph isomorphism
- neural network