Greedy Set Cover Estimations
Abstract
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.