Author:
Clifford Raphaël,Gotthilf Zvi,Lewenstein Moshe,Popa Alexandru
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Barone, P., Bonizzoni, P., Vedova, G.D., Mauri, G.: An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In: Symposium on Applied Computing, pp. 56–60 (2001)
2. Berger, B., Peter, W.S.: Approximation algorithms for the maximum acyclic subgraph problem. In: SODA, pp. 236–243 (1990)
3. Bläser, M.: A 3/4-approximation algorithm for maximum atsp with weights zero and one. In: APPROX-RANDOM, pp. 61–71 (2004)
4. Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM 41(4), 630–647 (1994)
5. Charikar, M., Guruswami, V., Manokaran, R.: Every permutation csp of arity 3 is approximation resistant. In: IEEE Conference on Computational Complexity, pp. 62–73 (2009)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献