I have a problem where I am supposed to analyze the
Steiner tree problem by doing the following 3 steps.
1) Look up what the Steiner tree problem is.
2) Find a polynomial time reduction to it from one of these 8 known NP-complete problems:
3) Prove that it is NP-complete.
My first problem is that I don't understand what the Steiner tree problem is. I can't find the problem anywhere. Wikipedia has a page on it, but doesn't really describe it in simple terms.
Can anyone help me out on this, and also give me hints for number 1, 2 and 3?