Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disopt.2007.10.001 | Discrete Optimization |
Keywords | Field | DocType |
logical analysis of data,quadratic set covering problem,approximation algorithms,unweighted version,usual set covering problem,quadratic set covering,negative approximation result,polynomial approximation property,convex case,natural generalization,general case,classical subcases,set covering problem,set cover | Set cover problem,Approximation algorithm,Discrete mathematics,Mathematical optimization,Combinatorics,Polynomial,Logical analysis of data,Quadratic equation,Regular polygon,Set packing,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
4 | 3-4 | Discrete Optimization |
Citations | PageRank | References |
5 | 0.47 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Escoffier | 1 | 430 | 37.32 |
| Peter L. Hammer | 2 | 1996 | 288.93 |