Table 3 Runtimes for artificial data by Jacob et al. Average runtimes of the heuristic approach of Jacob et al. [1], the FPT algorithm, and the ILP approach. (*) The FPT algorithm was not able to solve 17 instances of size 25 with edge probability 0.5 within 7 days of computation.
From: On optimal comparability editing with applications to molecular diagnostics
size | 10 | 25 | ||||
|---|---|---|---|---|---|---|
edge probability | 0.2 | 0.5 | 0.8 | 0.2 | 0.5 | 0.8 |
avg. cost | 2.35 | 6.15 | 5.95 | 20.2 | 60.5 | 46.6 |
time Jacob et al. | < 0.2 s | < 0.2 s | < 0.2 s | 2.95 h | 12.2 h | 30.4 h |
time FPT | 4 ms | 7 ms | 5 ms | 209 ms | 12.2 h* | 5.9 min |
time ILP | < 0.5 ms | 1.5 ms | 0.5 ms | 2 ms | 0.65 s | 30 ms |