A Geometric Characterization of Poly-antimatroids

DOI10.1016/j.endm.2007.01.050zbMath1291.05032OpenAlexW2024351607MaRDI QIDQ3439605

Yulia Kempner, Vadim E. Levit

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.050

zbMATH Keywords

abstract convexitymultisetpoly-antimatroid

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Impartial hypergraph games ⋮ Distributive Lattice Polyhedra

Cites Work

• Unnamed Item
• Chip-firing games on graphs
• Greedoids
• Correspondence between two antimatroid algorithmic characterizations
• Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
• An algorithmic characterization of antimatroids
• Introduction to Greedoids
• Cooperative Games under Augmenting Systems

This page was built for publication: A Geometric Characterization of Poly-antimatroids