Go to the corresponding LIPIcs Volume Portal 
Asahiro, Yuichi ; Eto, Hiroshi ; Gong, Mingyang ; Jansson, Jesper ; Lin, Guohui ; Miyano, Eiji ; Ono, Hirotaka ; Tanaka, Shunichi
pdfformat: 

@InProceedings{asahiro_et_al:LIPIcs.CPM.2023.2, author = {Asahiro, Yuichi and Eto, Hiroshi and Gong, Mingyang and Jansson, Jesper and Lin, Guohui and Miyano, Eiji and Ono, Hirotaka and Tanaka, Shunichi}, title = {{Approximation Algorithms for the Longest Run Subsequence Problem}}, booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)}, pages = {2:12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772761}, ISSN = {18688969}, year = {2023}, volume = {259}, editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17956}, URN = {urn:nbn:de:0030drops179560}, doi = {10.4230/LIPIcs.CPM.2023.2}, annote = {Keywords: Longest run subsequence problem, bounded occurrence, approximation algorithm} }
Keywords:  Longest run subsequence problem, bounded occurrence, approximation algorithm  
Collection:  34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)  
Issue Date:  2023  
Date of publication:  21.06.2023 