The unweighted and weighted reverse shortest path problem for disk graphs

DOI10.4230/LIPICS.ESA.2023.67MaRDI QIDQ6657029zbMATH OpenFDO

Authors Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.67

zbMATH Keywords

BFScomputational geometryDijkstra's algorithmdisk graphsgeometric optimizationreverse shortest path

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Computing diameter+2 in truly-subquadratic time for unit-disk graphs
• Single-source shortest path problem in weighted disk graphs
• Faster algorithms for reverse shortest path in unit-disk graphs and related geometric optimization problems: improving the shrink-and-bifurcate technique
• An optimal algorithm for shortest paths in unweighted disk graphs
• BFS and reverse shortest paths for ball intersection graphs in three and higher dimensions

This page was built for publication: The unweighted and weighted reverse shortest path problem for disk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657029)