A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial time approximation scheme for the probability maximizing shortest path problem |
scientific article |
Statements
A fully polynomial time approximation scheme for the probability maximizing shortest path problem (English)
0 references
11 March 2022
0 references
combinatorial optimization
0 references
shortest path
0 references
probability maximization
0 references
exact algorithm
0 references
fully polynomial time approximation scheme
0 references
0 references
0 references
0 references
0 references
