Highly Influenced

- Published 2007 in SIAM J. Comput.
DOI:10.1137/S0097539702420474

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

Showing 1-10 of 18 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

### Presentations referencing similar topics