Benjamin F. Drews

most citedOptimal

(t, r)

Broadcasts On the Infinite Grid

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2017

Computing upper bounds for optimal density of $(t, r)$ broadcasts on the infinite grid

Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph

The domination number of a finite graph $G$ with vertex set $V$ is the cardinality of the smallest set $S \subseteq V$ such that for every vertex $v \in V$ either $v \in S$ or $v$ is…

math.CO2017★ 1 cited

Optimal $(t, r)$ Broadcasts On the Infinite Grid

Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph

Let $G = (V, E)$ be a graph and $t, r$ be positive integers. The signal that a vertex $v$ receives from a tower of signal strength $t$ located at vertex $T$ is defined as $sig(v,T)=max…

Computing upper bounds for optimal density of (t,r) broadcasts on the infinite grid

Optimal (t,r) Broadcasts On the Infinite Grid

Computing upper bounds for optimal density of $(t, r)$ broadcasts on the infinite grid

Optimal $(t, r)$ Broadcasts On the Infinite Grid