Sciweavers

SIAMDM
2008

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search

13 years 11 months ago
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
Asaf Levin
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMDM
Authors Asaf Levin
Comments (0)