Reverse Shortest Path Problem for Unit-Disk Graphs

Authors

Haitao Wang, Utah State UniversityFollow
Yiming Zhao, Utah State University

Document Type

Article

Journal/Book Title/Conference

Algorithms and Data Structures

Volume

12808

Publisher

Springer

Publication Date

7-31-2021

Award Number

NSF, Division of Computing and Communication Foundations (CCF) 2005323

Funder

NSF, Division of Computing and Communication Foundations (CCF)

First Page

655

Last Page

668

Abstract

Given a set P of n points in the plane, a unit-disk graph G_r(P) with respect to a radius r is an undirected graph whose vertex set is P such that an edge connects two points p, q ∈ P is the number of edges of the path. Given a value λ > 0 and two points s and t of P, we consider the following reverse shortest path problem: finding the smallest r such that the shortest path length between s and t in G_r(P) is at most λ. It was known previously that the problem can be solved in O(n^5/4log²n) time.

Recommended Citation

Wang, Haitao and Zhao, Yiming, "Reverse Shortest Path Problem for Unit-Disk Graphs" (2021). Computer Science Faculty and Staff Publications. Paper 36.
https://digitalcommons.usu.edu/computer_science_facpubs/36