Approximation algorithms for the longest run subsequence problem

DOI10.4230/LIPICS.CPM.2023.2MaRDI QIDQ6622004zbMATH OpenFDO

Authors Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, S. Tanaka

Publication date 21 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2023.2

zbMATH Keywords

approximation algorithmbounded occurrencelongest run subsequence problem

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(2)

• The longest subsequence-duplicated subsequence and related problems
• Representing paths in digraphs

This page was built for publication: Approximation algorithms for the longest run subsequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622004)