1566 search results - page 46 / 314 » On a Cone Covering Problem |
144
click to vote
DCC
2002
IEEE
15 years 5 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
154
click to vote
ISAAC
2009
Springer
16 years 16 days ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
177
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
155
click to vote
JACM
1998
15 years 5 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
233
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...