Matroids on convex geometries (cg-matroids)
From MaRDI portal
Publication:882114
DOI10.1016/j.disc.2006.09.037zbMath1114.52018OpenAlexW2095973980MaRDI QIDQ882114
Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
Publication date: 23 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.037
Related Items
Toward an Automatic Approach to Greedy Algorithms, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Unnamed Item, Convex rough sets on finite domains, Matroids on convex geometries: subclasses, operations, and optimization, Rank functions of strict cg-matroids, Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid, A general model for matroids and the greedy algorithm, Rank axiom of modular supermatroids: a connection with directional DR submodular functions
Cites Work
- Poset matching---a distributive analog of independent matching
- An intersection theorem for supermatroids
- Greedoids
- Extreme point axioms for closure spaces
- Choice functions over a finite set: A summary
- The theory of convex geometries
- A circuit set characterization of antimatroids
- Geometries on partially ordered sets
- Matroids on partially ordered sets
- Choice functions and abstract convex geometries
- Closure lattices
- The intersection of matroids and antimatroids
- Mathematics of Plott choice functions
- Submodular functions and optimization.
- Parametric properties of the transportation problem and relations to supermatroids
- Monotonic functions of many-valued logic and supermatroids
- Optimization theory on antichains with the Steinitz exchange property
- Convexity in Graphs and Hypergraphs
- General theory of best variants choice: Some aspects
- Theory of Matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
