Near-optimal scheduling in the congested clique (Q2117708)

From MaRDI portal
Revision as of 22:27, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Near-optimal scheduling in the congested clique
scientific article

    Statements

    title
    Near-optimal scheduling in the congested clique (English)
    0 references
    author
    Keren Censor-Hillel
    0 references
    Yannic Maus
    0 references
    Volodymyr Polosukhin
    0 references
    publication date
    22 March 2022
    0 references
    zbMATH Keywords
    distributed algorithms
    0 references
    congested clique
    0 references
    scheduling
    0 references
    maximal independent set
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Mxx
    0 references
    68Q11
    0 references
    68R10
    0 references
    zbMATH DE Number
    7495133
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2117708&oldid=14612247"
    Powered by MediaWiki