Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

Marko Djukanovic, Günther Raidl, Christian Blum
January 2020
bib DOI

Abstract

Full Citation:

Marko Djukanovic, Günther R. Raidl, Christian Blum. Anytime Algorithms for the Longest Common Palindromic Subsequence Problem. Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.

Type
Journal Article
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.