The complexity of vector partition (Q2155634)

From MaRDI portal
Revision as of 14:55, 29 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
The complexity of vector partition
scientific article

    Statements

    title
    The complexity of vector partition (English)
    0 references
    author
    Shmuel Onn
    0 references
    publication date
    15 July 2022
    0 references
    zbMATH Keywords
    partition
    0 references
    clustering
    0 references
    combinatorial optimization
    0 references
    parameterized complexity
    0 references
    integer programming
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    68Q27
    0 references
    68Uxx
    0 references
    68Wxx
    0 references
    90C27
    0 references
    90C10
    0 references
    15Axx
    0 references
    51Mxx
    0 references
    52Axx
    0 references
    52Bxx
    0 references
    52Cxx
    0 references
    62Hxx
    0 references
    zbMATH DE Number
    7557646
    0 references
    OpenAlex ID
    W3200060794
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2155634&oldid=36829416"
    Powered by MediaWiki