Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (Q5389975)

From MaRDI portal
Revision as of 11:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6027214
Language Label Description Also known as
English
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
scientific article; zbMATH DE number 6027214

    Statements

    0 references
    0 references
    0 references
    24 April 2012
    0 references
    0 references
    polynomial-time approximation scheme
    0 references
    bounded-genus graph
    0 references
    embedded graph
    0 references
    Steiner tree
    0 references
    survivable-network design
    0 references
    subset TSP
    0 references
    0 references
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (English)
    0 references