A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (Q4805401)
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 1910246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation scheme for the two-source minimum routing cost spanning trees |
scientific article; zbMATH DE number 1910246 |
Statements
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (English)
0 references
14 May 2003
0 references
approximation algorithms
0 references
undirected graph
0 references
0.9719727
0 references
0.9190145
0 references
0.91047466
0 references
0.9098409
0 references
0.8986051
0 references
0.89720225
0 references
0.8952279
0 references
