Reverse shortest path problem in weighted unit-disk graphs
From MaRDI portal
Publication:2154091
DOI10.1007/978-3-030-96731-4_12OpenAlexW4225987021MaRDI QIDQ2154091FDOQ2154091
Authors: Yanyan Li 
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_12
Cites Work
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- A sweepline algorithm for Voronoi diagrams
- Generalized Selection and Ranking: Sorted Matrices
- Optimal Search in Planar Subdivisions
- Finding kth paths and p-centers by generating and searching good data structures
- Optimal Point Location in a Monotone Subdivision
- On an instance of the inverse shortest paths problem
- Shortest paths in intersection graphs of unit disks
- Computation of the reverse shortest-path problem
- On bounded leg shortest paths problems
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- An Expander-Based Approach to Geometric Optimization
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- Reverse shortest path problem for unit-disk graphs
- A note on Euclidean near neighbor searching in the plane
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Cited In (4)
This page was built for publication: Reverse shortest path problem in weighted unit-disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154091)
