A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network (Q1197968)
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 92055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network |
scientific article; zbMATH DE number 92055 |
Statements
A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network (English)
0 references
16 January 1993
0 references
minimal cost-to-time ratio
0 references
all-pairs minimum average weighted length path
0 references
0.7961414456367493
0 references
0.7939095497131348
0 references
0.7893424034118652
0 references
0.7882456183433533
0 references
0.7853983044624329
0 references
