Today we’ll continue with the Steiner Tree Problem. We’ve just about got a reduction; so, it’s time to prove our reduction is correct.
- Here are today’s new notes on the proof (part 3 of the series).
- Here’s a solution to the second part of our SP notes.
- For next time, please read Section 8.8. (It’s got a lovely little discussion of dynamic programming as well!) There will be no reading quiz.
- Assignment due tomorrow!