Parallel and sequential approximation of shortest superstrings

This publication has 9 references indexed in Scilit:

• On the hardness of approximating minimization problems
  Published by Association for Computing Machinery (ACM) ,1993
• Proof verification and hardness of approximation problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Linear approximation of shortest superstrings
  Published by Association for Computing Machinery (ACM) ,1991
• Approximation algorithms for the shortest common superstring problem
  Information and Computation, 1989
• Efficient NC algorithms for set cover with applications to learning and geometry
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• A greedy approximation algorithm for constructing shortest common superstrings
  Theoretical Computer Science, 1988
• Optimization, approximation, and complexity classes
  Published by Association for Computing Machinery (ACM) ,1988
• On finding minimal length superstrings
  Journal of Computer and System Sciences, 1980
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979