Maximum Coverage $k$-Antichains and Chains: A Greedy Approach

Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak +1

Given an acyclic digraph $G=(V,E)$ and a positive integer $k$, the problem of Maximum Coverage $k$-Antichains (resp. Chains) denoted as MA-$k$ (resp. MC-$k$) asks to find $k$ set…