Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
From MaRDI portal
Recommendations
Cites work
- A sweepline algorithm for Voronoi diagrams
- All-pairs shortest paths in geometric intersection graphs
- Decomposable searching problems
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Fine-grained complexity analysis of two classic TSP variants
- 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?)
- On bounded leg shortest paths problems
- Shortest paths in intersection graphs of unit disks
- Unit disk graphs
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
Cited in
(9)- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Shortest paths in intersection graphs of unit disks
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- Simple heuristics for unit disk graphs
- scientific article; zbMATH DE number 7236428 (Why is no real title available?)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
- ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
This page was built for publication: Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088993)
