Approximation ratios of repair, longestmatch and greedy on unary strings

HIGHLIGHTS

• who: Danny Hucke and Carl Philipp Reh from the Department Elektrotechnik und Informatik, Universität Siegen, Siegen, Germany have published the research work: Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings, in the Journal: Algorithms 2021, 14, 65. of /2021/
• what: The improved upper bound the authors show for Greedy uses unary words and is the first improvement that happened in 15 years. The authors show the worst-case approximation ratio of RePair and LongestMatch for unary words to be log2 . The authors show that v ∈ Xi* Xi*-1 · · · X * X j* · · · X1 . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.