Author:
Horn Matthias,Djukanovic Marko,Blum Christian,Raidl Günther R.
Publisher
Springer International Publishing
Reference20 articles.
1. Adi, S.S., et al.: Repetition-free longest common subsequence. Discret. Appl. Math. 158(12), 1315–1324 (2010)
2. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Boston (1983)
3. Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Decision diagrams for optimization. In: OŚullivan, B., Wooldridge, M. (eds.) Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42849-9
4. Lecture Notes in Computer Science;C Blum,2016
5. Blum, C., Blesa, M.J.: A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24(3), 551–579 (2017). https://doi.org/10.1007/s10732-017-9329-x
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Solving the Minimum Common String Partition Problem by Decision Diagrams;Proceedings of the 11th International Conference on Operations Research and Enterprise Systems;2022