Author:
Golovnev Alexander,Kulikov Alexander S.,Mihajlin Ivan
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Armen, C., Stein, C.: A
$2\frac{3}{4}$
-Approximation Algorithm for the Shortest Superstring Problem. Tech. rep., Dartmouth College, Hanover, NH, USA (1994)
2. Lecture Notes in Computer Science;C. Armen,1995
3. Lecture Notes in Computer Science;C. Armen,1996
4. Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 328–336. ACM, New York (1991)
5. Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms 24(2), 340–353 (1997)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献