An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931)

From MaRDI portal
Revision as of 04:34, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7688311
Language Label Description Also known as
English
An Experimental Study of Algorithms for Online Bipartite Matching
scientific article; zbMATH DE number 7688311

    Statements

    title
    An Experimental Study of Algorithms for Online Bipartite Matching (English)
    0 references
    author
    Allan Borodin
    0 references
    Denis Pankratov
    0 references
    publication date
    23 May 2023
    0 references
    zbMATH Keywords
    bipartite graphs
    0 references
    bipartite matching
    0 references
    greedy algorithms
    0 references
    stochastic input models
    0 references

    Identifiers

    arXiv ID
    1808.04863
    0 references
    DOI
    10.1145/3379552
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68W27
    0 references
    zbMATH DE Number
    7688311
    0 references
    OpenAlex ID
    W3011788258
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6039931&oldid=37517725"
    Powered by MediaWiki