1486 search results - page 4 / 298 » Algorithms for two-box covering |
75
Voted
CIKM
2010
Springer
15 years 24 days ago
2010
Springer
155
Voted
ESA
2011
Springer
14 years 2 months ago
2011
Springer
108
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
107
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
131
Voted
JCO
2010
15 years 1 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...