Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints (Q4925249): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:59, 8 February 2024
scientific article; zbMATH DE number 6174166
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints |
scientific article; zbMATH DE number 6174166 |
Statements
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints (English)
0 references
11 June 2013
0 references
\(k\)-disjoint bi-constraint path
0 references
NP-hard
0 references
bifactor approximation algorithm
0 references
auxiliary graph
0 references
cycle cancellation
0 references
