Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
scientific article

    Statements

    Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    polynomial-time approximation scheme
    0 references
    bounded-genus graphs
    0 references
    Steiner tree
    0 references
    subset TSP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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