Single-source shortest path problem in weighted disk graphs
From MaRDI portal
Cites work
- A framework for approximation schemes on disk graphs
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic connectivity in disk graphs
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Faster algorithms for cycle hitting problems on disk graphs
- Finding a maximum clique in a disk graph
- Geometric approximation algorithms
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- Improved algorithms for distance selection and related problems
- Minimum cuts in geometric intersection graphs
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Shortest paths in intersection graphs of unit disks
- The unweighted and weighted reverse shortest path problem for disk graphs
- Well-separated pair decomposition for the unit-disk graph metric and its applications
This page was built for publication: Single-source shortest path problem in weighted disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312645)
