BibTeX
@inproceedings{DBLP:conf/approx/ChrobakKS04,
author = {Marek Chrobak and
Petr Kolman and
Jiri Sgall},
title = {The Greedy Algorithm for the Minimum Common String Partition
Problem},
booktitle = {APPROX-RANDOM},
year = {2004},
pages = {84-95},
ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3122{\&}spage=84},
crossref = {DBLP:conf/approx/2004},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/approx/2004,
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'e} D. P. Rolim and
Dana Ron},
title = {Approximation, Randomization, and Combinatorial Optimization,
Algorithms and Techniques, 7th International Workshop on
Approximation Algorithms for Combinatorial Optimization
Problems, APPROX 2004, and 8th International Workshop on
Randomization and Computation, RANDOM 2004, Cambridge, MA,
USA, August 22-24, 2004, Proceedings},
booktitle = {APPROX-RANDOM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {3122},
year = {2004},
isbn = {3-540-22894-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2004-12-13 by Michael Ley (ley@uni-trier.de)