An approximation algorithm for the total cover problem
Abstract
We introduce a 2-approximation algorithm for the minimum total covering number problem.
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.