Skip to Main content Skip to Navigation
Conference papers

On-line Minimum Closed Covers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01391035
Contributor : Hal Ifip <>
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

File

978-3-662-44722-2_12_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Costas 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⟩

Share

Metrics

Record views

127

Files downloads

320