Computation of the reverse shortest-path problem
From MaRDI portal
Recommendations
- Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
- scientific article; zbMATH DE number 815126
- Shortest shortest path trees of a network
- scientific article; zbMATH DE number 1341907
Cited in
(19)- scientific article; zbMATH DE number 4060972 (Why is no real title available?)
- Reverse shortest path problem for unit-disk graphs
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- Further study on reverse 1-center problem on trees
- The inverse 1-median problem on tree networks with variable real edge lengths
- A tight amortized bound for path reversal
- Reverse shortest path problem in weighted unit-disk graphs
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- A polynomial-time algorithm to find shortest paths with recourse
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Lower bound sets for biobjective shortest path problems
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
- Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
- On reverse shortest paths in geometric proximity graphs
- Location of speed-up subnetworks
- Reverse maximum flow problem under the weighted Chebyshev distance
- Outlier respecting points approximation
- The shortest path improvement problems under Hamming distance
- Some inverse optimization problems under the Hamming distance
This page was built for publication: Computation of the reverse shortest-path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810889)
