Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605)

From MaRDI portal
Revision as of 09:29, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximability of maximum splitting of k-sets and some other Apx-complete problems
scientific article

    Statements

    Approximability of maximum splitting of k-sets and some other Apx-complete problems (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    Approximation
    0 references
    Algorithms
    0 references
    Combinatorial problems
    0 references
    Computational complexity
    0 references

    Identifiers