Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings.

Danny Hucke


Anthology ID:DBLP:conf/spire/Hucke19
Volume:String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Year:2019
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:3-15
URL:https://doi.org/10.1007/978-3-030-32686-9_1
DOI:https://doi.org/10.1007/978-3-030-32686-9_1
DBLP:conf/spire/Hucke19
BibTeX:
@inproceedings{hucke-2019-approximation, author = {Danny Hucke}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {{Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings}}, booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {3--15}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9_1}, doi = {https://doi.org/10.1007/978-3-030-32686-9_1} }