Kai Plociennik. A probabilistic PTAS for shortest common superstring. Theoretical Computer Science, 522:44-53, 2014. [doi]
@article{Plociennik14,
title = {A probabilistic PTAS for shortest common superstring},
author = {Kai Plociennik},
year = {2014},
doi = {10.1016/j.tcs.2013.12.005},
url = {http://dx.doi.org/10.1016/j.tcs.2013.12.005},
researchr = {https://researchr.org/publication/Plociennik14},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {522},
pages = {44-53},
}