New complexity results for the k-covers problem

This publication has 14 references indexed in Scilit:

• Computing the λ-covers of a string
  Information Sciences, 2007
• Fast and Practical Algorithms for Computing All the Runs in a String
  2007
• Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
  2004
• Computing the Cover Array in Linear Time
  Algorithmica, 2002
• Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
  SIAM Journal on Computing, 2002
• Optimal superprimitivity testing for strings
  Information Processing Letters, 1991
• Optimal off-line detection of repetitions in a string
  Theoretical Computer Science, 1983
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
  SIAM Journal on Computing, 1982
• An optimal algorithm for computing the repetitions in a word
  Information Processing Letters, 1981
• A linear-time approximation algorithm for the weighted vertex cover problem
  Journal of Algorithms, 1981