A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q650915)

From MaRDI portal
Revision as of 17:05, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
scientific article

    Statements

    A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (English)
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    hypergraph embedding
    0 references
    weighted cycle
    0 references
    minimum congestion
    0 references
    NP-hard
    0 references
    polynomial time approximation scheme
    0 references

    Identifiers