Steiner Tree
Input description: A graph G=(V,E), a subset T of the vertices V, and a bound B
Problem description: Is there a tree connecting all the vertices of T of total weight at most B?
Example:
Network design and wiring layout.
Previous slide
Next slide
Back to first slide
View graphic version