Abstract
In this paper we design a dynamic dictionary for the priced information model initiated by [2,3]. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model, we propose a dynamic dictionary, supporting insert, delete, and search for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments.
Work supported by NSERC.
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
Aho, A., Hopcroft, J., Ullman, J.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)
Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information. Journal of Computer and System Sciences 64 (2002)
Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information (extended abstract). In: Proc. ACM Symp. on Theory of Computation, pp. 582–591. ACM, New York (2000)
Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proc. IEEE Symp. on Foundations of Comp. Sci. (2001)
Kannan, S., Khanna, S.: Selection with monotone comparison costs. In: Proc. ACMSIAM Symp. on Discrete Algorithms (2003)
Komlos, J., Ma, Y., Szemeredi, E.: Matching nuts and bolts in O(n log n) time. SIAM Journal on Discrete Mathematics 11 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maheshwari, A., Smid, M. (2003). A Dynamic Dictionary for Priced Information with Application. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive