Reverse shortest path problem for unit-disk graphs

DOI10.1007/978-3-030-83508-8_47MaRDI QIDQ832915zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 25 March 2022

Full work available at URL https://arxiv.org/abs/2104.14476

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1507300 (Why is no real title available?)
• 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 framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
• A sweepline algorithm for Voronoi diagrams
• An Expander-Based Approach to Geometric Optimization
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computation of the reverse shortest-path problem
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Near-optimal algorithms for shortest paths in weighted unit-disk graphs
• New lower bounds for Hopcroft's problem
• On an instance of the inverse shortest paths problem
• On bounded leg shortest paths problems
• Shortest paths in intersection graphs of unit disks
• Slowing down sorting networks to obtain faster sorting algorithms
• Sorting in \(c \log n\) parallel steps
• Unit disk graphs
• 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)

• Shortest paths in intersection graphs of unit disks
• An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
• Reverse shortest path problem in weighted unit-disk graphs
• On reverse shortest paths in geometric proximity graphs

This page was built for publication: Reverse shortest path problem for unit-disk graphs

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