Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems

We consider a class of optimization problems, where the input is an undirected graph with two weight functions dened for each node, namely the node's pro t and its cost. The goal is to nd a connected set of nodes of low cost and high pro t. We present approximation algorithms for three natural optimization criteria that arise in this context, all of which… CONTINUE READING