Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data (Q3578355)

From MaRDI portal
Revision as of 20:43, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
scientific article

    Statements

    Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 2010
    0 references
    prize collecting Steiner tree
    0 references
    interval data
    0 references
    2-trees
    0 references

    Identifiers