Original paper
Approximation algorithm for minimum partial multi-cover under a geometric setting
Abstract
In a minimum partial set multi-cover problem (MinPSMC), given an element set X, a collection of subsets null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null ${\mathcal {S}} \subseteq 2^X
null null null null...
Paper Details
Title
Approximation algorithm for minimum partial multi-cover under a geometric setting
Published Date
May 18, 2021
Journal
Volume
16
Issue
2
Pages
667 - 680
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History