@InProceedings{bentley_et_al:LIPIcs.ESA.2020.15,
author = {Bentley, Jason W. and Gibney, Daniel and Thankachan, Sharma V.},
title = {{On the Complexity of BWT-Runs Minimization via Alphabet Reordering}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.15},
URN = {urn:nbn:de:0030-drops-128819},
doi = {10.4230/LIPIcs.ESA.2020.15},
annote = {Keywords: BWT, NP-hardness, APX-hardness}
}