We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard to approximate in the general case, and even in classical subcases (when the size of each set or when the frequency of each element is bounded by a constant). Then we focus on the convex case and give both positive and negative approximation results. Finally, we tackle the unweighted version of this problem. © 2007 Elsevier Ltd. All rights reserved.
Escoffier, B., & Hammer, P. L. (2007). Approximation of the Quadratic Set Covering problem. Discrete Optimization, 4(3–4), 378–386. https://doi.org/10.1016/j.disopt.2007.10.001