1424 search results - page 73 / 285 » The Multi-radius Cover Problem |
82
Voted
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
102
Voted
IJSNET
2006
15 years 24 days ago
2006
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
106
click to vote
COR
2007
15 years 24 days ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...