Finding the k Shortest Paths (Q4210169)
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: Finding the k Shortest Paths |
scientific article; zbMATH DE number 1200808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the k Shortest Paths |
scientific article; zbMATH DE number 1200808 |
Statements
Finding the k Shortest Paths (English)
0 references
21 September 1998
0 references
shortest paths
0 references
network programming
0 references
path enumeration
0 references
near-optimal solutions
0 references
dynamic programming
0 references
knapsack problem
0 references
sequence alignment
0 references
inscribed polygon
0 references
genealogy
0 references
0 references
0 references
0 references
0 references
0.9547309
0 references
0.9490326
0 references
0.9347122
0 references
0.9295797
0 references
0.9194021
0 references
0 references
0.91694695
0 references
