Approximation algorithm for minimum partial multi-cover under a geometric setting
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Letters"
DOI: 10.1007/s11590-021-01746-9
Abstract: In a minimum partial set multi-cover problem (MinPSMC), given an element set X , a collection of subsets $${\mathcal {S}} \subseteq 2^X$$ S ⊆ 2 X , a cost $$c_S$$ c S on each set… read more here.
Keywords: approximation algorithm; problem; multi cover; minimum partial ... See more keywords