Sciweavers

1486 search results - page 4 / 298
» Algorithms for two-box covering
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Set cover algorithms for very large datasets
Graham Cormode, Howard J. Karloff, Anthony Wirth
ESA
2011
Springer
242views Algorithms» more  ESA 2011»
12 years 7 months ago
Cover-Decomposition and Polychromatic Numbers
Béla Bollobás, David Pritchard, Thom...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 7 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
JCO
2010
182views more  JCO 2010»
13 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
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...
Chen Liao, Shiyan Hu