Abstract
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the cost of comparing two elements is a random variable. Each cost is chosen independently and is known to the algorithm. In particular we consider the following three models: each cost is chosen uniformly in the range [0,1], each cost is 0 with some probability p and 1 otherwise, or each cost is 1 with probability p and infinite otherwise. We present lower and upper bounds (optimal in most cases) for these problems. We obtain our upper bounds by carefully designing algorithms to ensure that the costs incurred at various stages are independent and using properties of random partial orders when appropriate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Blum, M., Fiat, A., Kannan, S., Naor, M., Ostrovsky, R.: Matching nuts and bolts. In: SODA, pp. 690–696 (1994)
Alon, N., Bollobás, B., Brightwell, G., Janson, S.: Linear extensions of a random partial order. Annals of Applied Probability 4, 108–123 (1994)
Brightwell, G.: Models of random partial orders, pp. 53–83 (1993)
Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J.M., Raghavan, P., Sahai, A.: Query strategies for priced information. J. Comput. Syst. Sci. 64(4), 785–819 (2002)
Cicalese, F., Laber, E.S.: A new strategy for querying priced information. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 674–683. ACM, New York (2005)
Cicalese, F., Laber, E.S.: An optimal algorithm for querying priced information: Monotone boolean functions and game trees. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 664–676. Springer, Heidelberg (2005)
Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and Selection in Posets (2007), http://arxiv.org/abs/0707.1532
Dyer, M.E., Frieze, A.M., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. In: STOC, pp. 375–381. ACM, New York (1989)
Fredman, M.L.: How good is the information theory bound in sorting? Theor. Comput. Sci. 1(4), 355–361 (1976)
Frieze, A.M.: Value of a random minimum spanning tree problem. J. Algorithms 10(1), 47–56 (1985)
Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: FOCS, pp. 416–425 (2001)
Gupta, A., Kumar, A.: Where’s the winner? Max-finding and sorting with metric costs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 74–85. Springer, Heidelberg (2005)
Kahn, J., Kim, J.H.: Entropy and sorting. J. Comput. Syst. Sci. 51(3), 390–399 (1995)
Kahn, J., Saks, M.: Balancing poset extensions. Order 1, 113–126 (1984)
Kannan, S., Khanna, S.: Selection with monotone comparison cost. In: SODA, pp. 10–17 (2003)
Kislitsyn, S.S.: A finite partially ordered set and its corresponding set of permutations. Mathematical Notes 4, 798–801 (1968)
Komlós, J., Ma, Y., Szemerédi, E.: Matching nuts and bolts in O(n logn) time. SIAM J. Discrete Math. 11(3), 347–372 (1998)
Linial, N.: The information-theoretic bound is good for merging. SIAM J. Comput. 13(4), 795–801 (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelov, S., Kunal, K., McGregor, A. (2008). Sorting and Selection with Random Costs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-78773-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78772-3
Online ISBN: 978-3-540-78773-0
eBook Packages: Computer ScienceComputer Science (R0)