Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks
Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks
Let $(r_1, s_1), \ldots, (r_n, s_n)$ be a sequence of requests to place arcs on the unit circle, where $0 \leq r_i, s_i \leq 1$ are endpoints relative to some origin on the circle. The first request is always satisfied by reserving, or parking, the shorter of the two arcs …