A greedy algorithm for convex geometries (Q1410695)

From MaRDI portal
Revision as of 19:06, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A greedy algorithm for convex geometries
scientific article

    Statements

    title
    A greedy algorithm for convex geometries (English)
    0 references
    author
    Kenji Kashiwabara
    0 references
    Yoshio Okamoto
    0 references
    publication date
    14 October 2003
    0 references
    Mathematics Subject Classification ID
    90C57
    0 references
    90C27
    0 references
    05B35
    0 references
    52B40
    0 references
    zbMATH DE Number
    1992941
    0 references
    zbMATH Keywords
    Antimatroid
    0 references
    Convex geometry
    0 references
    Extreme set
    0 references
    Greedy algorithm
    0 references
    Submodularity
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1410695&oldid=1723625"
      Powered by MediaWiki