On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964)

From MaRDI portal
Revision as of 01:44, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
scientific article

    Statements

    On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (English)
    0 references
    0 references
    0 references
    8 May 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    network optimization
    0 references