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

Günther Raidl
January 2022
PDF Cite DOI
Type
Conference Paper
Günther Raidl
Günther Raidl

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