On-line Minimum Closed Covers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

On-line Minimum Closed Covers

Costas S. Iliopoulos
  • Function : Author
  • PersonId : 992344


The Minimum Closed Covers problem asks us to compute a minimum size of a closed cover of given string. In this paper we present an on-line O(n)-time algorithm to calculate the size of a minimum closed cover for each prefix of a given string w of length n. We also show a method to recover a minimum closed cover of each prefix of w in greedy manner from right to left.
Fichier principal
Vignette du fichier
978-3-662-44722-2_12_Chapter.pdf (94.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01391035 , version 1 (02-11-2016)





Costas S. Iliopoulos, Manal Mohamed. On-line Minimum Closed Covers. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. pp.106-115, ⟨10.1007/978-3-662-44722-2_12⟩. ⟨hal-01391035⟩
32 View
142 Download



Gmail Facebook Twitter LinkedIn More