Geometric Matching and Bottleneck Problems

Sergio Cabello, Siu-Wing Cheng, Otfried Cheong +1

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p\in P$ has an associated supply…