Dominating Set, Independent Set, Discrete -Center, Dispersion, and Related Problems for Planar Points in Convex Position
A Tkachenko, H Wang - arXiv preprint arXiv:2501.00207, 2024 - arxiv.org
Given a set $ P $ of $ n $ points in the plane, its unit-disk graph $ G (P) $ is a graph with $ P
$ as its vertex set such that two points of $ P $ are connected by an edge if their (Euclidean) …
$ as its vertex set such that two points of $ P $ are connected by an edge if their (Euclidean) …
Geometric Assignment and Geometric Bottleneck
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 …
ranges, such as for example disks or rectangles, where each $ p\in P $ has an associated …
Geometric matching and bottleneck problems
Let P be a set of at most n points and let R be a set of at most n geometric ranges, such as
disks and rectangles, where each p∈ P has an associated supply s_ {p}> 0, and each r∈ R …
disks and rectangles, where each p∈ P has an associated supply s_ {p}> 0, and each r∈ R …