Sciweavers

4255 search results - page 10 / 851
» Cover
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 11 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
CCCG
2010
13 years 9 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
ESORICS
2009
Springer
14 years 8 months ago
Set Covering Problems in Role-Based Access Control
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
Liang Chen, Jason Crampton
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
14 years 1 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 28 days ago
The Multi-radius Cover Problem
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
Refael Hassin, Danny Segev