cover version | cover | Cover version | Set the Controls for the Heart of the Sun | Set | Go-Set | Cover Drive | Year 2000 problem | Set (mythology) | Scuba set | Erector Set | Waring's problem | The Final Problem | Mandelbrot set | Do Not Adjust Your Set | XML Information Set | Under Cover of Darkness | The World Set Free | The Vanity Set | The Ready Set | The Problem with Popplers | The Death Set | television set | set | Murder-Set-Pieces | I Set My Friends on Fire | Hume and the Problem of Causation | Dirichlet problem | Desk Set | Boolean satisfiability problem |
he studied a weighted version of the set cover problem, and proved that a greedy algorithm provides good approximations to the optimal solution, generalizing previous unweighted results by David S. Johnson (J. Comp. Sys. Sci. 1974) and László Lovász (Discrete Math. 1975).