A Truthful 2-approximation Mechanism for the Steiner Tree Problem The Steiner Tree problem INPUT: Undirected, weighted graph G=(V,E,c) N V: set of terminal nodes OUTPUT:…
