Approximation algorithms and hardness results for the clique packing problem (Q5900079)

From MaRDI portal
Revision as of 17:26, 11 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5284939
Language Label Description Also known as
English
Approximation algorithms and hardness results for the clique packing problem
scientific article; zbMATH DE number 5284939

    Statements

    Approximation algorithms and hardness results for the clique packing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    approximation algorithms
    0 references
    APX-hardness
    0 references
    clique
    0 references
    packing
    0 references
    triangle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references