Approximation algorithms for disjoint \(st\)-paths with minimum activation cost (Q4924633)
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: Approximation algorithms for disjoint st-paths with minimum activation cost |
scientific article; zbMATH DE number 6171990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for disjoint \(st\)-paths with minimum activation cost |
scientific article; zbMATH DE number 6171990 |
Statements
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost (English)
0 references
7 June 2013
0 references
0.8652418255805969
0 references
0.8461057543754578
0 references
0.8066098093986511
0 references
0.806408703327179
0 references
0.7617805600166321
0 references
