Pat Morin

Let *G*=(*V*,*E*) be an undirected geometric graph with
vertex set *V*={x_{1},…x_{n}} in R^{d}.
The *transmission radius*, *r*_{i}, of a
vertex, *x*_{i}, is defined as the length of the
longest edge incident on *x*_{i}; the *transmission
ball*, *b*_{i}, is the ball of radius
*r*_{i} centered at *x*_{i}.
The *interference* at a vertex *x*_{i} is the
number of transmission balls that contain *x*_{i}.
The *interference* of *G* is the maximum interference over
all vertices of *G*.

One of the goals of wireless network design is to minimize inteference:
Given *V*⊂R^{d}, select edges *E* so that
*G*=(*V*,*E*) is connected and has minimum interference.
In this talk we will survey algorithmic, probabilistic, and hardness
results on this problem.