Greedy Set Cover Estimations
classification
💻 cs.DM
keywords
covergreedyalgorithmcasecomplexityestimationestimationsgiven
read the original abstract
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.