论文信息 - Approximate Sorting

Approximate Sorting

We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n2/ν(n) needs at least n (min{log ν(n), log n} – 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n(log ν(n)+1) comparisons are always sufficient.

[1] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .

[2] Manuel Blum,et al. Linear time bounds for median computations , 1972, STOC.

[3] R. Graham,et al. Spearman's Footrule as a Measure of Disarray , 1977 .

[4] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[6] Avi Wigderson,et al. Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing , 1992, Symposium on the Theory of Computing.

[7] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[8] Bernard Chazelle,et al. The soft heap: an approximate priority queue with optimal error rate , 2000, JACM.

[9] Yeong-Nan Yeh,et al. Presorting algorithms: An average-case point of view , 2000, Theor. Comput. Sci..

[10] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .

[11] David Thomas,et al. The Art in Computer Programming , 2001 .