Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (Q3569819)
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 5724207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems |
scientific article; zbMATH DE number 5724207 |
Statements
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (English)
0 references
22 June 2010
0 references
graph algorithms
0 references
length-bounded paths
0 references
complexity
0 references
approximation algorithms
0 references
0.89440787
0 references
0.89440787
0 references
0.8928737
0 references
0.88700217
0 references
0.8864795
0 references
0.88191915
0 references
0.8805164
0 references
