Minimum cost perfect matching with delays for two sources (Q1628601)

From MaRDI portal
Revision as of 21:01, 31 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129508123, #quickstatements; #temporary_batch_1730404649853)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum cost perfect matching with delays for two sources
scientific article

    Statements

    title
    Minimum cost perfect matching with delays for two sources (English)
    0 references
    author
    Yuval Emek
    0 references
    Yaacov Shapiro
    0 references
    Yuyi Wang
    0 references
    publication date
    4 December 2018
    0 references
    zbMATH Keywords
    online algorithms
    0 references
    min-cost perfect matching with delays
    0 references
    two sources
    0 references
    competitive analysis
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W27
    0 references
    05C70
    0 references
    68R10
    0 references
    68W20
    0 references
    zbMATH DE Number
    6988755
    0 references
    OpenAlex ID
    W2883104186
    0 references
    Wikidata QID
    Q129508123
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1628601&oldid=37868091"
    Powered by MediaWiki