Plociennik, Kai A probabilistic PTAS for shortest common superstring. (English) Zbl 1279.68360 Theor. Comput. Sci. 522, 44-53 (2014). MSC: 68W25 68Q17 68Q32 68W20 PDFBibTeX XMLCite \textit{K. Plociennik}, Theor. Comput. Sci. 522, 44--53 (2014; Zbl 1279.68360) Full Text: DOI
Plociennik, Kai A probabilistic PTAS for shortest common superstring. (English) Zbl 1250.68286 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 624-635 (2009). MSC: 68W25 68W32 PDFBibTeX XMLCite \textit{K. Plociennik}, Lect. Notes Comput. Sci. 5734, 624--635 (2009; Zbl 1250.68286) Full Text: DOI