1424 search results - page 32 / 285 » The Multi-radius Cover Problem |
104
click to vote
APPROX
2006
Springer
15 years 4 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...
128
Voted
EPS
1998
Springer
15 years 5 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
105
Voted
NIPS
2007
15 years 2 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...