An approximation algorithm for the total cover problem
classification
💻 cs.DS
keywords
algorithmapproximationproblemtotalcovercoveringintroduceminimum
read the original abstract
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
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.