- Set-Cover Approximation
Krishnaiyan "KT" Thulasiraman, Subramanian Arumugam, Andreas Brandstädt, Takao Nishizeki · 2016
The Weighted Set-Cover Problem: given a collection S of sets over a universe U , and aweight ws ≥ 0 for each set s ∈ S, find a collection C ⊆ S of the sets whose union is U-a set cover-of minimum weight ∑s∈C ws.