An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823)

From MaRDI portal
Revision as of 02:54, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
scientific article

    Statements

    An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2015
    0 references
    approximation algorithms
    0 references
    partial-terminal Steiner trees
    0 references
    Steiner tree problem
    0 references

    Identifiers