Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701)
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: Efficient approximation algorithms for computing k disjoint constrained shortest paths |
scientific article; zbMATH DE number 6641531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths |
scientific article; zbMATH DE number 6641531 |
Statements
Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (English)
0 references
20 October 2016
0 references
LP rounding
0 references
flow theory
0 references
\(k\)-disjoint constrained shortest path
0 references
bifactor approximation algorithm
0 references
cycle cancellation
0 references
0 references
0.8796657919883728
0 references
0.8689528107643127
0 references
0.8685190081596375
0 references
0.7870996594429016
0 references
0.7836620807647705
0 references
