Brandt, Felix; Fischer, Felix - In: Mathematical Social Sciences 56 (2008) 2, pp. 254-268
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm...