Incremental approximate single-source shortest paths with predictions
From MaRDI portal
Cites work
- An On-Line Edge-Deletion Problem
- Competitive Caching with Machine Learned Advice
- Competitive strategies to use ``warm start algorithms with predictions
- Daisy Bloom filters
- Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
- Deterministic decremental SSSP and approximate min-cost flow in almost-linear time
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time
- Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window)
- scientific article; zbMATH DE number 1306899 (Why is no real title available?)
- scientific article; zbMATH DE number 7788484 (Why is no real title available?)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
- Incremental SSSP for sparse digraphs beyond the hopset barrier
- Learning-augmented maximum flow
- Maintaining shortest paths under deletions in weighted directed graphs
- Near-optimal decremental SSSP in dense weighted digraphs
- New algorithms and hardness for incremental single-source shortest paths in directed graphs
- On dynamic graph algorithms with predictions
- On dynamic shortest paths problems
- On the complexity of algorithms with predictions for dynamic graph problems
- Online algorithms for weighted paging with predictions
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
This page was built for publication: Incremental approximate single-source shortest paths with predictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363205)
