Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (Q2944499)

From MaRDI portal
Revision as of 00:46, 13 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56077951, #quickstatements; #temporary_batch_1710286856230)
scientific article
Language Label Description Also known as
English
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
scientific article

    Statements

    Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (English)
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    spanning trees
    0 references
    approximation algorithms
    0 references
    minimum spanning trees
    0 references
    network design
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references