Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (Q2944499)
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 6477829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design |
scientific article; zbMATH DE number 6477829 |
Statements
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (English)
0 references
2 September 2015
0 references
spanning trees
0 references
approximation algorithms
0 references
minimum spanning trees
0 references
network design
0 references
1.0000001192092896
0 references
0.8437502384185791
0 references
0.8331069350242615
0 references
0.8326165676116943
0 references
0.831843912601471
0 references
