Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6457763
| 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 6457763 |
Statements
Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (English)
0 references
10 July 2015
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
0.9973884224891664
0 references
0.8711798787117004
0 references
0.8685190081596375
0 references
0.7816680073738098
0 references
0.7745345234870911
0 references
