Minimum common string partition problem: hardness and approximations.
Goldstein, Avraham ; Kolman, Petr ; Zheng, Jie
The Electronic Journal of Combinatorics [electronic only], Tome 12 (2005), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2005-01-01
EUDML-ID : urn:eudml:doc:126825 
@article{02221790,
     title = {Minimum common string partition problem: hardness and approximations.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {12},
     year = {2005},
     zbl = {1102.68139},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02221790}
}

Goldstein, Avraham; Kolman, Petr; Zheng, Jie. Minimum common string partition problem: hardness and approximations.. The Electronic Journal of Combinatorics [electronic only], Tome 12 (2005) . http://gdmltest.u-ga.fr/item/02221790/