TY - JOUR
AU1 - Damaschke, Peter
AB - Suppose that n elements shall be sorted by comparisons, but some subset of at most k pairs systematically returns false comparison results. This subset is unknown, but the number k is known in advance. Using a connection to feedback arc sets in tournaments (FAST), we characterize the solution space of sorting with recurring comparison faults by a FAST enumeration, which represents all information about the order that can be obtained by doing all
n
2
$\left (\begin {array}{c}n\\2\end {array}\right )$
comparisons. Some optimal parameterized enumeration algorithm for FAST also works for the more general chordal graphs, and this fact contributes to the efficiency of our representation. Next we compute the solution space more efficiently, by fault-tolerant versions of Treesort and Quicksort. We need
O
(
n
log
n
+
k
n
+
k
2
log
n
)
$O(n\log n +kn+k^{2}\log n)$
comparisons and
O
(
n
log
n
+
k
n
+
k
2
log
n
+
k
F
(
k
2
,
k
)
)
$O(n\log n +kn+k^{2}\log n +kF(k^{2},k))$
time, where F(n, k) is any parameterized time bound for finding a FAST with at most k arcs. Thus, for rare faults the complexity is close to optimal. We also propose directions of further research, revolving around decision diagrams for sorting with recurring faults.
TI - The Solution Space of Sorting with Recurring Comparison Faults
JF - Theory of Computing Systems
DO - 10.1007/s00224-017-9807-4
DA - 2017-08-31
UR - https://www.deepdyve.com/lp/springer-journals/the-solution-space-of-sorting-with-recurring-comparison-faults-mkOAftaH4Q
SP - 1427
EP - 1442
VL - 62
IS - 6
DP - DeepDyve