The minimum substring cover problem
type: Item
instance of: scholarly article
title: The minimum substring cover problem
zbMATH Open document ID: 1162.90592
author: Danny Hermelin
author: Dror Rawitz
author: Romeo Rizzi
author: Stéphane Vialette
published in: Information and Computation
publication date: 2008-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5377242
zbMATH Keywords: approximation algorithms
zbMATH Keywords: dictionary generation
zbMATH Keywords: local-ratio
zbMATH Keywords: randomized rounding
zbMATH Keywords: substring cover
MaRDI profile type: Publication
full work available at URL: j.ic.2008.06.002
OpenAlex ID: W1620365865
cites work: Some APX-completeness results for cubic graphs
cites work: One for the price of two: a unified approach for approximating covering problems
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Q3221758
cites work: A note on decidability questions on presentations of word semigroups
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem
cites work: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Approximation algorithms for combinatorial problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Elementariness of a finite set of words is co-NP-complete
cites work: Optimization, approximation, and complexity classes
cites work: Q4527015
cites work: Q4140407
DOI: 10.1016/J.IC.2008.06.002
description: scientific article; zbMATH DE number 5377242