Computing constrained shortest-paths at scale
From MaRDI portal
Recommendations
- On an exact method for the constrained shortest path problem
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- scientific article; zbMATH DE number 1670670
Cites work
- scientific article; zbMATH DE number 5610761 (Why is no real title available?)
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- A linear-size logarithmic stretch path-reporting distance oracle for general graphs
- Arriving on time
- Beyond highway dimension: small distance labels using tree skeletons
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Engineering Label-Constrained Shortest-Path Algorithms
- Fare evasion in transit networks
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Highway dimension and provably efficient shortest path algorithms
- Hitting sets when the VC-dimension is small
- Lower bounds in the preprocessing and query phases of routing algorithms
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Precomputation techniques for the stochastic on-time arrival problem
- Reachability and Distance Queries via 2-Hop Labels
- Stochastic Shortest Paths Via Quasi-convex Maximization
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Travelling on graphs with small highway dimension
- VC-dimension and shortest path algorithms
Cited in
(9)- Route planning with flexible edge restrictions
- Bottleneck shortest paths on a partially ordered scale
- scientific article; zbMATH DE number 5141522 (Why is no real title available?)
- scientific article; zbMATH DE number 2084770 (Why is no real title available?)
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Engineering Label-Constrained Shortest-Path Algorithms
- scientific article; zbMATH DE number 5039783 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Shortest path with acceleration constraints: complexity and approximation algorithms
This page was built for publication: Computing constrained shortest-paths at scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031006)
