Reverse shortest path problem in weighted unit-disk graphs

DOI10.1007/978-3-030-96731-4_12MaRDI QIDQ2154091zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-96731-4_12

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 6861957 (Why is no real title available?)
• scientific article; zbMATH DE number 7236428 (Why is no real title available?)
• A note on Euclidean near neighbor searching in the plane
• A sweepline algorithm for Voronoi diagrams
• An Expander-Based Approach to Geometric Optimization
• Computation of the reverse shortest-path problem
• 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
• Generalized Selection and Ranking: Sorted Matrices
• Near-optimal algorithms for shortest paths in weighted unit-disk graphs
• On an instance of the inverse shortest paths problem
• On bounded leg shortest paths problems
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Reverse shortest path problem for unit-disk graphs
• Shortest paths in intersection graphs of unit disks
• The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
• Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications

Cited in

(4)

• An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
• Near-optimal algorithms for shortest paths in weighted 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

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)