A greedy algorithm for interval greedoids

Abstract We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.

[1]  Vadim E. Levit,et al.  On local maximum stable set greedoids , 2012, Discret. Math..

[2]  Hugh Thomas,et al.  Oriented Interval Greedoids , 2009, Discret. Comput. Geom..

[3]  Henry D. Shapiro,et al.  An Exact Characterization of Greedy Structures , 1993, IPCO.