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 the normal view instead:
scientific article; zbMATH DE number 5306536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.990009307861328
0 references
0.7853193879127502
0 references
0.7824133634567261
0 references
0.7763877511024475
0 references
0.7745454907417297
0 references
