An efficient algorithm for partial order production

We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases of this problem include sorting by comparisons, selection, multiple selection, and heap construction. We give an algorithm performing ITLB + o(ITLB) + O(n) comparisons in the worst case. Here, n denotes the size of the ground sets, and ITLB denotes a natural information-theoretic lower bound on the number of comparisons needed to produce the target poset. The overall complexity of our algorithm is polynomial. This answers a question of Yao (SICOMP, 1989). Our strategy is to extend the poset S to a weak order W whose corresponding information-theoretic lower bound is provably not much larger than that for S. Taking W instead of S as a target poset, we then solve the problem by applying a multiple selection algorithm that performs not much more than ITLB comparisons. We base our analysis on the entropy of the target poset S, a quantity that can be efficiently computed and provides a good estimate of ITLB.

[1]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[2]  Gregory J. E. Rawlins,et al.  On the Comparison Cost of Partial Orders , 1988 .

[3]  Jean Cardinal,et al.  Tight Results on Minimum Entropy Set Cover , 2006, Algorithmica.

[4]  Kurt Mehlhorn,et al.  Towards Optimal Multiple Selection , 2005, ICALP.

[5]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[6]  László Lovász,et al.  Entropy splitting for antiblocking corners and perfect graphs , 1990, Comb..

[7]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[8]  Michael Saks,et al.  The Information Theoretic Bound for Problems on Ordered Sets and Graphs , 1985 .

[9]  Alois Panholzer.  Analysis of multiple quickselect variants , 2003, Theor. Comput. Sci..

[10]  Richard P. Stanley,et al.  Two poset polytopes , 1986, Discret. Comput. Geom..

[11]  Béla Bollobás,et al.  Sorting and Graphs , 1985 .

[12]  Svante Carlsson,et al.  The complexity of heaps , 1992, SODA '92.

[13]  Jeff Kahn,et al.  Entropy and sorting , 1992, STOC '92.

[14]  David P. Dobkin,et al.  Optimal Time Minimal Space Selection Algorithms , 1981, JACM.

[15]  Nathan Linial,et al.  The Information-Theoretic Bound is Good for Merging , 1984, SIAM J. Comput..

[16]  Jingsen Chen.  Average Cost to Produce Partial Orders , 1994, ISAAC.

[17]  John M. Chambers,et al.  Algorithm 410: Partial sorting , 1971 .

[18]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[19]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[20]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[21]  Helmut Prodinger,et al.  Multiple Quickselect - Hoare's Find Algorithm for Several Elements , 1995, Inf. Process. Lett..

[22]  Svante Carlsson,et al.  Some Lower Bounds for Comparison-Based Algorithms , 1994, ESA.

[23]  Michael L. Fredman,et al.  How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..

[24]  J. Kahn,et al.  Balancing poset extensions , 1984 .

[25]  Martin Aigner.  Producing posets , 1981, Discret. Math..

[26]  Andrew Chi-Chih Yao.  On the Complexity of Partial Order Productions , 1989, SIAM J. Comput..

[27]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[28]  Jean Cardinal,et al.  An Efficient Algorithm for Partial Order Production , 2010, SIAM J. Comput..