BibTeX
@inproceedings{DBLP:conf/wg/Ott99,
author = {Sascha Ott},
title = {Lower Bounds for Approximating Shortest Superstrings over
an Alphabet of Size 2},
booktitle = {WG},
year = {1999},
pages = {55-64},
ee = {http://link.springer.de/link/service/series/0558/bibs/1665/16650055.htm},
crossref = {DBLP:conf/wg/1999},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/wg/1999,
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan Eidenbenz},
title = {Graph-Theoretic Concepts in Computer Science, 25th International
Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999,
Proceedings},
booktitle = {WG},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1665},
year = {1999},
isbn = {3-540-66731-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-01-03 by Michael Ley (ley@uni-trier.de)