The Rectilinear Steiner Tree Problem is $NP$-Complete (Q4179026)

From MaRDI portal
Revision as of 02:33, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56338024, #quickstatements; #temporary_batch_1707252663060)
scientific article; zbMATH DE number 3614797
Language Label Description Also known as
English
The Rectilinear Steiner Tree Problem is $NP$-Complete
scientific article; zbMATH DE number 3614797

    Statements

    The Rectilinear Steiner Tree Problem is $NP$-Complete (English)
    0 references
    0 references
    0 references
    1977
    0 references
    Steiner Tree Problem
    0 references
    Np-Complete
    0 references
    Net Wiring Patterns
    0 references

    Identifiers