On-line Minimum Closed Covers - Artificial Intelligence Applications and Innovations (AIAI 2014 - Workshops:CoPA,MHDW, IIVC, and MT4BD)
Conference Papers Year : 2014

On-line Minimum Closed Covers

Costas S. Iliopoulos
  • Function : Author
  • PersonId : 992344
King‘s College London
Manal Mohamed
  • Function : Author
King‘s College London

Abstract

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.

Domains

Computer Science [cs]
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)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01391035

Submitted on : Wednesday, November 2, 2016-5:14:19 PM

Last modification on : Thursday, March 5, 2020-5:41:10 PM

Long-term archiving on : Friday, February 3, 2017-3:00:48 PM

Download

Dates and versions

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

Licence

Attribution

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP IFIP-AICT IFIP-TC IFIP-WG IFIP-TC12 IFIP-AIAI IFIP-WG12-5 IFIP-AICT-437
53 View
173 Download

Altmetric

Share

More