A Faster Approximation Algorithm for the Steiner Problem in Graphs.
Ying-Fung WuPeter WidmayerC. K. WongPublished in: Acta Informatica (1986)
Keyphrases
- computational complexity
- times faster
- preprocessing
- dynamic programming
- matching algorithm
- cost function
- error bounds
- learning algorithm
- approximation ratio
- significant improvement
- experimental evaluation
- worst case
- expectation maximization
- objective function
- memory efficient
- convergence rate
- theoretical analysis
- detection algorithm
- segmentation algorithm
- closed form
- particle swarm optimization
- np hard
- recognition algorithm
- minimum spanning tree
- k means
- search space
- graph isomorphism
- maximum common subgraph