A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7487823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial time approximation scheme for the probability maximizing shortest path problem |
scientific article; zbMATH DE number 7487823 |
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
0.8531792759895325
0 references
0.7989320158958435
0 references
0.7921946048736572
0 references
0.7831301689147949
0 references
