Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



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

Approximating Dense Cases of Covering Problems

Comments: 1

We study dense instances of several covering problems. An instance of
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
that the dense set cover problem can be approximated with ... more >>>




ISSN 1433-8092 | Imprint