2 papers
cs.CG2026
Efficient Algorithms for the Bottleneck Path Problem in Geometric Graphs
Matthew J. Katz, Rachel Saban, Micha Sharir
We present efficient algorithms for the bottleneck path problem in two geometric settings that arise naturally in applications: directional-antenna graphs in the plane with antenna…
cs.CG2023
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
Haim Kaplan, Matthew J. Katz, Rachel Saban +1
We study the reverse shortest path problem on disk graphs in the plane. In this problem we consider the proximity graph of a set of disks in the plane of arbitrary radii: In th…