Greedy matching: guarantees and limitations (Q513303)

From MaRDI portal
Revision as of 13:07, 13 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
Greedy matching: guarantees and limitations
scientific article

    Statements

    title
    Greedy matching: guarantees and limitations (English)
    0 references
    author
    Bert Besser
    0 references
    Matthias Poloczek
    0 references
    published in
    Algorithmica
    0 references
    publication date
    6 March 2017
    0 references
    zbMATH Keywords
    maximum matching
    0 references
    greedy algorithms
    0 references
    approximation algorithms
    0 references
    priority algorithms
    0 references
    randomized algorithms
    0 references
    cites work
    Q4385084
    0 references
    Q3579469
    0 references
    Matching theory
    0 references
    Q4344227
    0 references
    Q3824126
    0 references

    Identifiers

    zbMATH DE Number
    6691984
    0 references
    OpenAlex ID
    W2146319320
    0 references
    arXiv ID
    1505.04198
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q513303&oldid=36309506"
    Powered by MediaWiki