Fig. 4
From: On the parameterized complexity of the median and closest problems under some permutation metrics
a Hypothesis of the instances of Lemma 4.2. b Case that is not possible for a yes-instance, since more than d operations are necessary to place a in the same position as one of the input permutations. c Case where c is not in a position \(\ell \) for a median solution. Note that this permutation could be changed to the permutation \(s^*\) applying the same number of operations. d Case that is not possible for a yes-instance, since more than d operations are necessary to place e in the same position as one of the input permutations