Approximability of partitioning graphs with supply and demand (Q1002107): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:52, 5 March 2024

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