Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
From MaRDI portal
Publication:506709
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
- scientific article; zbMATH DE number 1870046 (Why is no real title available?)
- Probabilistic top-\(k\) dominating queries in uncertain databases
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- The number of shortest paths in the arrangement graph
Cited in
(5)- Efficient computation of continuous range skyline queries in road networks
- Safe-region generation methods for continuous trip route planning queries
- Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
- Efficient processing of all neighboring object group queries with budget range constraint in road networks
- Pickup scheduling algorithms with spatio-temporal coordination for urban educational facilities
This page was built for publication: Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506709)