A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem

Abstract

Full Citation:

Marc Huber, Günther R. Raidl. A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem. Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 13789 of LNCS, pages 87-95, 2023, Springer.

Günther Raidl

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