Kfir Barhum: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem. SOFSEM 2014: 77-88