Faster Algorithms for Semi-Matching Problems (Q2799478)

From MaRDI portal
Revision as of 19:12, 11 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
Faster Algorithms for Semi-Matching Problems
scientific article

    Statements

    title
    Faster Algorithms for Semi-Matching Problems (English)
    0 references
    DOI
    10.1145/2601071
    0 references
    author
    Jittat Fakcharoenphol
    0 references
    Bundit Laekhanukit
    0 references
    Danupon Nanongkai
    0 references
    publication date
    11 April 2016
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C70
    0 references
    68P05
    0 references
    68Q25
    0 references
    90B35
    0 references
    90C27
    0 references
    zbMATH DE Number
    6567107
    0 references
    zbMATH Keywords
    semi-matching
    0 references
    combinatorial optimization
    0 references
    design and analysis of algorithms
    0 references
    scheduling
    0 references
    OpenAlex ID
    W2033561606
    0 references
    arXiv ID
    1004.3363
    0 references
    cites work
    Q3056948
    0 references
    Q4051615
    0 references
    Q4537758
    0 references
    Q3707420
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2799478&oldid=36241083"
    Powered by MediaWiki