Efficient Dynamic Range Minimum Query

A Heliou (1, 2) , M Léonard (3) , L Mouchard (3, 4) , Mikael Salson (5)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 AMIB - Algorithms and Models for Integrative Biology
3 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
4 CCWA - Center for Combinatorics on Words and Applications
5 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189

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.

Mots clés: Range Minimum Query; Dynamic Structure; Compressed Bit Vector; Longest Common Prefix

Domaines: Informatique [cs]; Algorithme et structure de données [cs.DS]

A Heliou, M Léonard, L Mouchard, Mikael Salson. Efficient Dynamic Range Minimum Query. 2016. ⟨hal-01255499v1⟩