This paper considers the recently popular beyond-worst-case algorithm
analysis model which integrates machine-learned predictions with online
algorithm design. We consider the online steiner tree problem in this model for
both directed and undirected graphs. Steiner tree is known to ha