Selection with monotone comparison costs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A new strategy for querying priced information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the competitive ratio of evaluating priced functions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Interchange Rearrangement: The Element-Cost Model
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the competitive ratio of evaluating priced functions
Journal of the ACM (JACM)
An optimal algorithm for querying priced information: monotone boolean functions and game trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Where's the winner? max-finding and sorting with metric costs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
String rearrangement metrics: a survey
Algorithms and Applications
| Hi-index | 0.00 |
The study of the effect of priced information on basic algorithmic problems was initiated by the paper of Charikar et al. [5]. In this paper, we continue the study of sorting and selection in the priced comparison model, i.e., when each comparison has an associated cost, and answer some of the open problems suggested by [5]. If the comparison costs are allowed to be arbitrary, we show that one can not get good approximation ratios. A different way to assign costs is based on the idea that one can distill out an intrinsic value for each item being compared such that the cost of comparing two elements is some "well-behaved" or "structured" function of their values. We feel that most practical applications will have some structured cost property.In this paper, we study the problems of sorting and selection (which includes finding the maximum and the median) in the structured cost model. We get a variety of approximation results for these problems, depending on the restrictions we put on the structured costs. We show that it is possible to get much improved results with the structured cost model than the case when we do not have any assumptions on comparison costs.