English

Greedy Set Cover Estimations

Discrete Mathematics 2011-07-22 v1

Abstract

More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.

Cite

@article{arxiv.1107.4224,
  title  = {Greedy Set Cover Estimations},
  author = {Hakob Aslanyan},
  journal= {arXiv preprint arXiv:1107.4224},
  year   = {2011}
}
R2 v1 2026-06-21T18:39:57.594Z