The Minimum Substring Cover Problem

DOI10.1007/978-3-540-77918-6_14zbMath1130.68100OpenAlexW4234807164MaRDI QIDQ5443381

Danny Hermelin, Romeo Rizzi, Stéphane Vialette, Dror Rawitz

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)

Related Items (1)

On Finding Small 2-Generating Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• One for the price of two: a unified approach for approximating covering problems
• Elementariness of a finite set of words is co-NP-complete
• Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: The Minimum Substring Cover Problem