A High Performance Approximate Algorithm for the Steiner Problem in Graphs.
Pere GuitartJosep M. BasartPublished in: RANDOM (1998)
Keyphrases
- times faster
- learning algorithm
- graph structure
- preprocessing
- np hard
- similarity measure
- k means
- cost function
- matching algorithm
- detection algorithm
- high accuracy
- random graphs
- theoretical analysis
- particle swarm optimization
- simulated annealing
- worst case
- experimental evaluation
- optimal solution
- expectation maximization
- dynamic programming
- computational complexity
- minimum spanning tree
- subgraph isomorphism