Complexity and approximation results for the min-sum and min-max disjoint paths problems (Q4610074)
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: Complexity and approximation results for the min-sum and min-max disjoint paths problems |
scientific article; zbMATH DE number 6856286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation results for the min-sum and min-max disjoint paths problems |
scientific article; zbMATH DE number 6856286 |
Statements
5 April 2018
0 references
disjoint paths
0 references
min-sum
0 references
min-max
0 references
computational complexity
0 references
approximation algorithms
0 references
0.97557270526886
0 references
0.861430287361145
0 references
0.8593969345092773
0 references
0.845176100730896
0 references
0.839838981628418
0 references
