Efficient Dynamic Range Minimum Query - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2016

Efficient Dynamic Range Minimum Query

Résumé

The Range Minimum Query problem consists in answering efficiently to a simple question: " what is the minimal element appearing between two specified indices of a given array? ". In this paper we present a novel approach that offers a satisfying trade-off between time and space. Moreover we show how the structure can be easily maintained whenever an insertion, modification or deletion modifies the array.
Fichier principal
Vignette du fichier
HLMS2015.pdf (326.97 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01255499 , version 1 (13-01-2016)
hal-01255499 , version 2 (15-11-2016)

Licence

Identifiants

  • HAL Id : hal-01255499 , version 1

Citer

A Heliou, M Léonard, L Mouchard, Mikael Salson. Efficient Dynamic Range Minimum Query. 2016. ⟨hal-01255499v1⟩
935 Consultations
1314 Téléchargements

Partager

More