4903 search results - page 57 / 981 » The Set Covering Machine |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
ICTAC
2004
Springer
14 years 2 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
ENTCS
2008
13 years 9 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
APPROX
2006
Springer
14 years 23 days ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...