A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:56, 8 February 2024
scientific article; zbMATH DE number 1417065
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees |
scientific article; zbMATH DE number 1417065 |
Statements
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (English)
0 references
19 March 2000
0 references
approximation algorithms
0 references
network design
0 references
spanning trees
0 references
computational biology
0 references
