Shortest path problems with node failures
From MaRDI portal
Recommendations
- Robust path choice in networks with failures
- Shortest-Path Routing in Arbitrary Networks
- scientific article; zbMATH DE number 1182917
- Approximate Single-Source Fault Tolerant Shortest Path
- scientific article; zbMATH DE number 1445588
- Shortest paths in reachability graphs
- Path problems in networks
- Robust shortest path problems
- Optimal fault-tolerant routings for connected graphs
- scientific article; zbMATH DE number 6850433
Cited in
(16)- Vertex-Uncertainty in Graph-Problems
- A survey on combinatorial optimization in dynamic environments
- Finding the shortest path in stochastic networks
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Dynamic journeying under uncertainty
- The most likely path on series-parallel networks
- Probabilistic graph-coloring in bipartite and split graphs
- A priori optimization for the probabilistic maximum independent set problem
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- The probabilistic minimum dominating set problem
- On the probabilistic minimum coloring and minimum k-coloring
- On the probabilistic min spanning tree problem
- The -reliable shortest path problem
- Bi-criteria path problem with minimum length and maximum survival probability
This page was built for publication: Shortest path problems with node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021823)
