Correspondence between two antimatroid algorithmic characterizations

zbMath1044.90062arXivmath/0307013MaRDI QIDQ1422131

Yulia Kempner, Vadim E. Levit

Publication date: 5 February 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0307013

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Critical sets, crowns and local maximum independent sets ⋮ Quasi-concave functions on meet-semilattices ⋮ Duality between quasi-concave functions and monotone linkage functions ⋮ Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm ⋮ Recognition of Antimatroidal Point Sets ⋮ A Geometric Characterization of Poly-antimatroids

This page was built for publication: Correspondence between two antimatroid algorithmic characterizations