5624 search results - page 30 / 1125 » On Conditional Covering Problem |
115
Voted
AINA
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...
113
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
119
click to vote
CCCG
2001
15 years 3 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
141
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
IEEEARES
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a pattern system for security requirements engineering, consisting of security problem frames and concretized security problem frames. These are special kinds of proble...