Sciweavers

1566 search results - page 13 / 314
» On a Cone Covering Problem
Sort
View
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
15 years 10 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
ESORICS
2009
Springer
16 years 4 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
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 8 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
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 9 months 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
FSTTCS
2003
Springer
15 years 9 months ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan