Problems on independence systems solvable by the greedy algorithm (Q3225892)

From MaRDI portal
Revision as of 01:17, 5 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
Problems on independence systems solvable by the greedy algorithm
scientific article

    Statements

    title
    Problems on independence systems solvable by the greedy algorithm (English)
    0 references
    DOI
    10.1515/DMA.2009.034
    0 references
    publication date
    23 March 2012
    0 references
    zbMATH DE Number
    6018382
    0 references
    zbMATH Keywords
    Rado-Edmonds theorem
    0 references
    maximisation problem
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3225892&oldid=35270775"
    Powered by MediaWiki