Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints (Q4925249)
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: Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints |
scientific article; zbMATH DE number 6174166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
1.0000002
0 references
0.9368177
0 references
0.9318806
0 references
0.92933834
0 references
0.91193473
0 references
0.9096872
0 references
0.9056411
0 references
0.9043553
0 references
0.9035642
0 references
