On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms |
scientific article |
Statements
On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (English)
0 references
6 October 2021
0 references
wireless networks
0 references
maximum disjoint paths with different colors
0 references
\(\mathcal{NP}\)-completeness
0 references
linear programming
0 references
