A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl
January 2022
PDF bib DOI

Abstract

Full Citation:

Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl. A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. (Note: best paper award winner)

Type
Conference Paper
Markus Kirchweger
Markus Kirchweger

Markus Kirchweger is a Project Assistant at the Algorithms and Complexity Group.

Günther Raidl
Günther Raidl

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