Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678)

From MaRDI portal
Revision as of 18:34, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 6947041
Language Label Description Also known as
English
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
scientific article; zbMATH DE number 6947041

    Statements

    Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    fixed-parameter tractable
    0 references
    maximum weight connected subgraph
    0 references
    node-weighted Steiner tree
    0 references
    Steiner tree
    0 references
    strong exponential time hypothesis
    0 references

    Identifiers

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