Reverse shortest path problem for unit-disk graphs

DOI10.1007/978-3-030-83508-8_47OpenAlexW3197652730MaRDI QIDQ832915FDOQ832915

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

• Unit disk graphs
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
• A sweepline algorithm for Voronoi diagrams
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms
• Sorting in \(c \log n\) parallel steps
• On an instance of the inverse shortest paths problem
• Shortest paths in intersection graphs of unit disks
• Computation of the reverse shortest-path problem
• Title not available (Why is that?)
• On bounded leg shortest paths problems
• New lower bounds for Hopcroft's problem
• 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?)
• 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

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)