1671 search results - page 117 / 335 » On the Covering Steiner Problem |
91
Voted
CCCG
2010
15 years 2 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
COR
2006
15 years 1 months ago
2006
This paper is concerned with extending models for the maximal covering location problem in two ways. First, the usual 0
ECCC
2006
15 years 1 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
ALGOSENSORS
2006
Springer
15 years 4 months ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
108
Voted
CCGRID
2003
IEEE
15 years 6 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...