Reverse shortest path problem in weighted unit-disk graphs
From MaRDI portal
Publication:2154091
DOI10.1007/978-3-030-96731-4_12OpenAlexW4225987021MaRDI QIDQ2154091
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_12
Related Items (3)
An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs ⋮ On reverse shortest paths in geometric proximity graphs ⋮ An algorithmic framework for the single source shortest path problem with applications to disk graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On bounded leg shortest paths problems
- Reverse shortest path problem for unit-disk graphs
- A sweepline algorithm for Voronoi diagrams
- On an instance of the inverse shortest paths problem
- A note on Euclidean near neighbor searching in the plane
- Computation of the reverse shortest-path problem
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Shortest paths in intersection graphs of unit disks
- Generalized Selection and Ranking: Sorted Matrices
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- An Expander-Based Approach to Geometric Optimization
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Finding kth paths and p-centers by generating and searching good data structures
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
This page was built for publication: Reverse shortest path problem in weighted unit-disk graphs
