Joseph S. B. Mitchell

16 citations · 20 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2015★ 1 cited

Computing the $L_{1}$ Geodesic Diameter and Center of a Polygonal Domain

Sang Won Bae, Matias Korman, Joseph S. B. Mitchell +3

For a polygonal domain with $h$ holes and a total of $n$ vertices, we present algorithms that compute the $L_{1}$ geodesic diameter in $O (n^{2} + h^{4})$ time and the $L_{1}$ geodesic center…

cs.DS2015★ 3 cited

Improved Approximation Algorithms for Relay Placement

Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell +2

In the relay placement problem the input is a set of sensors and a number $r \geq 1$ , the communication range of a relay. In the one-tier version of the problem the objective is to…

cs.DS2008★ 16 cited

The Minimum Backlog Problem

Michael A. Bender, Sándor P. Fekete, Alexander Kröller +4

We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-perso…

Computing the L1​ Geodesic Diameter and Center of a Polygonal Domain

Improved Approximation Algorithms for Relay Placement

The Minimum Backlog Problem

Computing the $L_{1}$ Geodesic Diameter and Center of a Polygonal Domain