Approximability of partitioning graphs with supply and demand (Q1002107)

From MaRDI portal
Revision as of 01:39, 29 June 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
Approximability of partitioning graphs with supply and demand
scientific article

    Statements

    Approximability of partitioning graphs with supply and demand (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2009
    0 references
    approximation algorithm
    0 references
    demand
    0 references
    FPTAS
    0 references
    graph partition problem
    0 references
    MAXSNP-hard
    0 references
    series-parallel graph
    0 references
    supply
    0 references

    Identifiers

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