Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem (bibtex)
by , ,
Reference:
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence ProblemMarko Djukanovic, Günther R. Raidl, Christian BlumProceedings of LION 12 – 12th International Conference on Learning and Intelligent Optimization, 2018, Springer.Note: In press
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 -- 12th International Conference on Learning and Intelligent Optimization},
	series = {Lecture Notes in Computer Science},
	publisher = {Springer},
	year = {2018},
      url = {https://www.ac.tuwien.ac.at/files/pub/djukanovic-18.pdf},
      keywords={Longest common palindromic subsequence problem, A* search, Beam search, hybrid optimization techniques},
	note = {In press}
}
Powered by bibtexbrowser