Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (Q3569819): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4301522924 / rank | |||
Normal rank | |||
Latest revision as of 20:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems |
scientific article |
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
