![Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover](https://www.pdfsearch.io/img/b8a409f54053b45a0fd0558046464047.jpg) Date: 2013-03-13 08:17:47Computational 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 ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 296,01 KBShare Document on Facebook
|