A Tutorial on Shortest Superstring Approximation Marcin

@inproceedings{Mucha2007ATO,
  title={A Tutorial on Shortest Superstring Approximation Marcin},
  author={Marcin Mucha},
  year={2007}
}
This is a tutorial on approximation algorithms for the Shortest Superstring Problem (SSP). My intention when writing it was to provide the foundations for actually doing research on this topic. In Section 2 I cover the basic definitions and observations and introduce the ”Greedy Conjecture”. In Section 3 I describe the standard framework for approximating… CONTINUE READING