The Minimum Substring Cover Problem

Document type :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00620289
Contributor : Stéphane Vialette <>
Submitted on : Wednesday, September 7, 2011 - 3:52:40 PM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM

Identifiers

  • HAL Id : hal-00620289, version 1

Collections

Citation

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette. The Minimum Substring Cover Problem. 5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183. ⟨hal-00620289⟩

Share

Metrics

Record views

178