A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844)

From MaRDI portal
Revision as of 08:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    spanning trees
    0 references
    computational biology
    0 references

    Identifiers