Abstract
In this paper we design a dynamic dictionary for the priced information model initiated by Charikar et al. 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 search, insert and delete, 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, a fundamental problem in computational geometry.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Maheshwari, A., Smid, M. A Dynamic Dictionary for Priced Information with Application. Algorithmica 44, 151–165 (2006). https://doi.org/10.1007/s00453-005-1204-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-005-1204-8