A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs.
Markus LeitnerIvana LjubicMartin LuipersbeckMax ReschPublished in: Hybrid Metaheuristics (2014)
Keyphrases
- maximum independent set
- series parallel
- minimum spanning tree
- graph theoretic
- graph model
- search algorithm
- graph theory
- graph matching
- optimal solution
- graph mining
- simulated annealing
- prize collecting
- dynamic programming
- greedy heuristic
- heuristic methods
- tabu search
- graph databases
- graph representation
- metaheuristic
- similarity search
- directed graph
- graph search
- graph structures
- subgraph isomorphism
- search procedure
- multicast routing
- independent set
- similarity measure
- combinatorial optimization