Martin Middendorf
Univ. Karlsruhe, Karlsruhe, Germany
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science