A greedy algorithm for convex geometries (Q1410695): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-submodular functions and convexity of their Lovász extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic characterization of antimatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular linear programs on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the rooted connectivity of a digraph by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural aspects of ordered polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256200 / rank
 
Normal rank

Latest revision as of 11:49, 6 June 2024

scientific article
Language Label Description Also known as
English
A greedy algorithm for convex geometries
scientific article

    Statements

    A greedy algorithm for convex geometries (English)
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Antimatroid
    0 references
    Convex geometry
    0 references
    Extreme set
    0 references
    Greedy algorithm
    0 references
    Submodularity
    0 references