Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths |
scientific article |
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
