Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > STEINER TREE:
Reports tagged with Steiner Tree:
TR97-004 | 19th February 1997
Marek Karpinski, Alexander Zelikovsky

#### Approximating Dense Cases of Covering Problems

the set cover problem with $m$ sets is dense if there is $\epsilon>0$
such that any element belongs to at least $\epsilon m$ sets. We show