# Sorting under partial information (without the ellipsoid algorithm)

par Cardinal, Jean ;Fiorini, Samuel ;Joret, Gwenaël ;Jungers, Raphaël ;Munro, J. Ian
Référence Combinatorica, 33, 6, page (655-697)
Publication Publié, 2013
Article révisé par les pairs
 Résumé : We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (J. Comput. System Sci. 51 (3), 390-399, 1995) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison, making it impractical. We develop efficient algorithms for sorting under partial information. Like Kahn and Kim, our approach relies on graph entropy. However, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy, we approximate the entropy, or make sure it is computed only once, in a restricted class of graphs, permitting the use of a simpler algorithm. Specifically, we present: 1. an O(n2) algorithm performing O(logn·log e(P)) comparisons; 2. an O(n2.5) algorithm performing at most (1 + e{open}) log e(P) + Oe{open}(n) comparisons; 3. an O(n2.5) algorithm performing O(log e(P)) comparisons. All our algorithms can be implemented in such a way that their computational bottleneck is confined in a preprocessing phase, while the sorting phase is completed in O(q)+O(n) time, where q denotes the number of comparisons performed. © 2013 János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.