1414 search results - page 44 / 283 » Cover Time and Broadcast Time |
CACM
2005
13 years 9 months ago
2005
them as an abstract cellular model where users access information through access points. ract model consists of a base station, a number of clients, and a number of channels. A cli...
IPL
2010
13 years 4 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
IJRR
2008
13 years 10 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...