Approximation Algorithms for the Longest Run Subsequence Problem

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka. Approximation Algorithms for the Longest Run Subsequence Problem. In Laurent Bulteau, Zsuzsanna Lipták, editors, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. Volume 259 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.