455 search results - page 26 / 91 » Approximation Algorithms for Partial Covering Problems |
169
click to vote
DEXA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
134
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
169
click to vote
COMPGEOM
2009
ACM
16 years 11 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
154
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
151
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...