Back to Results
First PageMeta Content
Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover


SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted
Add to Reading List

Document Date: 2013-03-13 08:17:47

Open Document

File Size: 296,01 KB

Share Result on Facebook
UPDATE