Improvements for the thresh X2 shortest path algorithm (Q1093560)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improvements for the thresh X2 shortest path algorithm |
scientific article; zbMATH DE number 4023054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improvements for the thresh X2 shortest path algorithm |
scientific article; zbMATH DE number 4023054 |
Statements
Improvements for the thresh X2 shortest path algorithm (English)
0 references
1987
0 references
The thresh X2 algorithm has been shown to dominate other shortest path algorithms over a wide variety of conditions. When used on random networks which have exponentially or normally distributed edge weights the performance of X2 degrades. We develop techniques which improve X2's performance up to 33\% in these cases.
0 references
thresh X2 algorithm
0 references
shortest path algorithms
0 references
random networks
0 references
0.86748874
0 references
0.8640756
0 references
0.85638493
0 references
0.8558377
0 references
0.8557127
0 references
0.8523881
0 references
0.8521837
0 references
0.8513726
0 references
