![Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Set cover problem / Approximation algorithm / Facility location problem / Dominating set / Combinatorial optimization / Reduction / Algorithm Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Set cover problem / Approximation algorithm / Facility location problem / Dominating set / Combinatorial optimization / Reduction / Algorithm](https://www.pdfsearch.io/img/e14bab40068931e544b62c83d4a94e37.jpg) Date: 2012-10-31 09:54:20Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm | | Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218Add to Reading ListSource URL: www.cs.tufts.eduDownload Document from Source Website File Size: 187,22 KBShare Document on Facebook
|