29,323 research outputs found
The Homogeneous Broadcast Problem in Narrow and Wide Strips
Let be a set of nodes in a wireless network, where each node is modeled
as a point in the plane, and let be a given source node. Each node
can transmit information to all other nodes within unit distance, provided
is activated. The (homogeneous) broadcast problem is to activate a minimum
number of nodes such that in the resulting directed communication graph, the
source can reach any other node. We study the complexity of the regular and
the hop-bounded version of the problem (in the latter, must be able to
reach every node within a specified number of hops), with the restriction that
all points lie inside a strip of width . We almost completely characterize
the complexity of both the regular and the hop-bounded versions as a function
of the strip width .Comment: 50 pages, WADS 2017 submissio
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
We consider the problem of covering the boundary of a simple polygon on n
vertices using the minimum number of geodesic unit disks. We present an O(n
\log^2 n+k) time 2-approximation algorithm for finding the centers of the
disks, with k denoting the number centers found by the algorithm
Topological Stability of Kinetic -Centers
We study the -center problem in a kinetic setting: given a set of
continuously moving points in the plane, determine a set of (moving)
disks that cover at every time step, such that the disks are as small as
possible at any point in time. Whereas the optimal solution over time may
exhibit discontinuous changes, many practical applications require the solution
to be stable: the disks must move smoothly over time. Existing results on this
problem require the disks to move with a bounded speed, but this model is very
hard to work with. Hence, the results are limited and offer little theoretical
insight. Instead, we study the topological stability of -centers.
Topological stability was recently introduced and simply requires the solution
to change continuously, but may do so arbitrarily fast. We prove upper and
lower bounds on the ratio between the radii of an optimal but unstable solution
and the radii of a topologically stable solution---the topological stability
ratio---considering various metrics and various optimization criteria. For we provide tight bounds, and for small we can obtain nontrivial
lower and upper bounds. Finally, we provide an algorithm to compute the
topological stability ratio in polynomial time for constant
- …