Papers
Topics
Authors
Recent
Search
2000 character limit reached

Greedy Set Cover Estimations

Published 21 Jul 2011 in cs.DM | (1107.4224v1)

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

Authors (1)
Citations (4)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up