Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7834794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings |
scientific article; zbMATH DE number 7834794 |
Statements
Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (English)
0 references
19 April 2024
0 references
data compression
0 references
grammar-based compression
0 references
approximation algorithm
0 references
addition chain
0 references
0.8214282393455505
0 references
0.8156887292861938
0 references
0.7933769822120667
0 references
0.7891236543655396
0 references
