1486 search results - page 4 / 298 » Algorithms for two-box covering |
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
SODA
2012
ACM
13 years 1 months ago
2012
ACM
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
100
click to vote
JCO
2010
14 years 10 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...