A heuristic for the Steiner problem in graphs.
B. N. KhouryPanos M. PardalosPublished in: Comput. Optim. Appl. (1996)
Keyphrases
- minimum spanning tree
- maximum independent set
- optimal solution
- directed graph
- graph theory
- graph representation
- dynamic programming
- search algorithm
- series parallel
- graph matching
- graph theoretic
- data sets
- graph databases
- graph structure
- spanning tree
- undirected graph
- tabu search
- beam search
- graph search
- greedy heuristic
- random walk
- evolutionary algorithm