Approximation algorithms for quickest spanning tree problems (Q1763146)
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 quickest spanning tree problems |
scientific article; zbMATH DE number 2135856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for quickest spanning tree problems |
scientific article; zbMATH DE number 2135856 |
Statements
Approximation algorithms for quickest spanning tree problems (English)
0 references
21 February 2005
0 references
Approximation algorithms
0 references
Quickest path problem
0 references
Minimum diameter spanning tree problem
0 references
0.9930821061134338
0 references
0.8057149648666382
0 references
0.7864252328872681
0 references
