Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155)
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: Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length |
scientific article; zbMATH DE number 5306536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length |
scientific article; zbMATH DE number 5306536 |
Statements
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (English)
0 references
31 July 2008
0 references
approximation algorithms
0 references
augmentation problems
0 references
graph algorithms
0 references
distance constraints
0 references
diameter
0 references
0 references
