Reverse shortest path problem for unit-disk graphs
From MaRDI portal
Publication:832915
DOI10.1007/978-3-030-83508-8_47OpenAlexW3197652730MaRDI QIDQ832915
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2104.14476
Related Items (3)
Reverse shortest path problem in weighted unit-disk graphs ⋮ An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs ⋮ On reverse shortest paths in geometric proximity graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On bounded leg shortest paths problems
- Sorting in \(c \log n\) parallel steps
- A sweepline algorithm for Voronoi diagrams
- Unit disk graphs
- On an instance of the inverse shortest paths problem
- Computation of the reverse shortest-path problem
- New lower bounds for Hopcroft's problem
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Shortest paths in intersection graphs of unit disks
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- An Expander-Based Approach to Geometric Optimization
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Slowing down sorting networks to obtain faster sorting algorithms
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
This page was built for publication: Reverse shortest path problem for unit-disk graphs
