Sciweavers

578 search results - page 8 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
COMPGEOM
2009
ACM
14 years 2 months ago
On the set multi-cover problem in geometric settings
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...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
CCCG
2008
13 years 9 months ago
On a Cone Covering Problem
Given a set of polyhedral cones C1,
Khaled M. Elbassioni, Hans Raj Tiwary
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 11 days ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan