Media type: E-Article Title: Graph-Theoretic Concepts in Computer Science: Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 Contributor: Ott, Sascha Published: Springer Berlin Heidelberg, 1999 Published in: Graph-Theoretic Concepts in Computer Science (1999), Seite 55-64 Language: Not determined DOI: 10.1007/3-540-46784-x_7 ISSN: 0302-9743 Origination: University thesis: Footnote: