Sascha Ott. Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. In Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz, editors, Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Volume 1665 of Lecture Notes in Computer Science, pages 55-64, Springer, 1999. [doi]
Abstract is missing.