A Dynamic Dictionary for Priced Information with Application

  • Anil Maheshwari
  • Michiel Smid
Conference paper

DOI: 10.1007/978-3-540-24587-2_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2906)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Anil Maheshwari
    • 1
  • Michiel Smid
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations