Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

DOI10.1007/978-3-319-30698-8_4MaRDI QIDQ6483593

Maria J. Blesa, Christian Blum

Publication date: 21 April 2016

Published in: 1519.68322 (Search for Journal in Brave)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Algorithms on strings (68W32)

This page was built for publication: Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem