Documents A Truthful 2-approximation Mechanism for the Steiner Tree Problem.

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

Documents A Truthful 2-approximation Mechanism for the Steiner Tree Problem

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:…