Computational Complexity - Research Seminar
Kai Plociennik (TU Chemnitz): A Probabilistic PTAS for Shortest Common Superstring
June 8, 2009, 10:15 a.m.
E 1 3, Room 415
In the talk, we present a new result on approximation algorithms for the shortest common superstring problem (SCS). It is well-known that there is a constant f>1 such that there is no efficient approximation algorithm for SCS achieving a factor of at most f in the worst case, unless P=NP. We study SCS on random inputs and present an approximation scheme that achieves, for every ε>0, a (1+ε)-approximation in expected polynomial time. This result applies not only if the letters are chosen independently at random, but also to the more realistic mixing model, which allows dependencies among the letters of the random strings. Our result is based on a sharp tail bound on the optimal compression, which improves a previous result by Frieze and Szpankowski.