The internal Steiner tree problem: Hardness and approximations (Q1931427)

From MaRDI portal
Revision as of 21:49, 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
The internal Steiner tree problem: Hardness and approximations
scientific article

    Statements

    The internal Steiner tree problem: Hardness and approximations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 January 2013
    0 references
    VLSI routing
    0 references
    approximation algorithms
    0 references
    MAX SNP-hardness
    0 references
    Steiner trees
    0 references
    the internal Steiner tree problem
    0 references
    design and analysis of algorithms
    0 references

    Identifiers

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