Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Djukanovic, Marko; Raidl, Günther R.; Blum, Christian

doi:https://doi.org/10.1007/978-3-030-05348-2_18

by Marko Djukanovic, Günther R. Raidl, Christian Blum

Reference:

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence ProblemMarko Djukanovic, Günther R. Raidl, Christian BlumProceedings of LION 12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer.

Bibtex Entry:

@inproceedings{djukanovic-18,
	author = {Marko Djukanovic and G{\"{u}}nther R. Raidl and Christian Blum},
	title = {Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem},
	booktitle = {Proceedings of LION~12 -- the 12th International Conference on Learning and Intelligent Optimization},
	volume = {11353},
	pages = {199--214},
	year = {2019},
	publisher = {Springer},
	series = {LNCS},
	doi = {https://doi.org/10.1007/978-3-030-05348-2_18}
}