Solving the Minimum String Cover Problem

DOI10.1137/1.9781611972924.8zbMath1430.68457OpenAlexW2293538822MaRDI QIDQ5233719

Stefan Canzar, Tobias Marschall, Chris Schwiegelshohn, Sven Rahmann

Publication date: 12 September 2019

Published in: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972924.8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Algorithms on strings (68W32)

Related Items

Efficient Computation of 2-Covers of a String.

Uses Software

• CPLEX