| M. Charikar, R. Fagin, V. Guruswami, J. Kleinberg, P. Raghavan and A. Sahai. Query Strategies for Priced Information. Proc. 32nd ACM Symposium on Theory of Computing, 2000. |
....with Monotone Comparison Costs Sampath Kannan Sanjeev Khanna Abstract We consider the problem of selecting the r smallest element from a list of n elements under a model where the comparisons may have different costs depending on the elements being compared. This model was introduced by [3] and is realistic in the context of comparisons between complex objects. An important special case of this general cost model is one where the comparison costs are monotone in the sizes of the elements being compared. This monotone cost model covers most natural cost models that arise and the ....
....that is known for arbitrary comparison costs. We also consider selection under a special case of monotone costs the min model where the cost of comparing two elements is the minimum of the sizes. We give a randomized O(1) competitive algorithm for the min model. 1 Introduction Charikar et al. [3] introduced the problem of computing a function at optimal cost when each input to the function has an associated price. They use the framework of competitive analysis, comparing the cost incurred by their algorithms to compute the function value to the cost of an optimal proof that the function ....
[Article contains additional citation context not shown here]
M. CHARIKAR, R. FAGIN, V. GURUSWAMI, J. KLEIN- BERG, P. RAGHAVAN, AND A. SAHAI. Query strategies for priced information. In Proceedings of 32nd ACM Symposium on Theory of Computing, pp. 582--591, 2000.
No context found.
M. Charikar, R. Fagin, V. Guruswami, J. Kleinberg, P. Raghavan and A. Sahai. Query Strategies for Priced Information. Proc. 32nd ACM Symposium on Theory of Computing, 2000.
No context found.
M. Charikar, R. Fagin, V. Guruswami, J. Kleinberg, P. Raghavan and A. Sahai. Query strategies for priced information. Journal of Computer and System Sciences 64(4):785-819, 2002.
No context found.
M. Charikar, R. Fagin, V. Guruswami, J. Kleinberg, P. Raghavan, and A. Sahai. Query strategies for priced information. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 582--591, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC