An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515)
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 5383151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs |
scientific article; zbMATH DE number 5383151 |
Statements
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (English)
0 references
17 December 2008
0 references
OR in telecommunications
0 references
paths with minimal cost sum
0 references
dual arc costs
0 references
disjoint paths
0 references
0.915599763393402
0 references
0.8018718957901001
0 references
0.7989386320114136
0 references
0.7957699298858643
0 references
