A branch and cut algorithm for the Steiner problem in graphs.
Abilio LucenaJohn E. BeasleyPublished in: Networks (1998)
Keyphrases
- objective function
- optimal solution
- preprocessing
- times faster
- learning algorithm
- dynamic programming
- significant improvement
- segmentation algorithm
- graph theoretical
- graph matching
- linear programming
- high accuracy
- input data
- theoretical analysis
- detection algorithm
- worst case
- improved algorithm
- spanning tree
- minimum spanning tree
- random graphs
- subgraph isomorphism
- probabilistic model
- steiner tree
- adjacency graph