Lyndon Words and Short Superstrings

TL;DR

This paper presents a new approximation algorithm for the Shortest-Superstring problem that surpasses the long-standing 2.5 ratio barrier by leveraging Lyndon words and combining solutions from different Max-ATSP-Path algorithms.

Contribution

It introduces a novel algorithm achieving a 2 11/23 approximation ratio for the Shortest-Superstring problem, improving upon the previous 2 1/2 bound using Lyndon words.

Findings

Achieved an approximation ratio of 2 11/23 for Shortest-Superstring.

Developed a new theory of string overlaps based on Lyndon words.

Combined solutions from different Max-ATSP-Path algorithms to improve results.

Abstract

In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known approximation factor is 2 1/2, given by Sweedyk in 1999. Since then no improvement has been made, howerever two other approaches yielding a 2 1/2-approximation algorithms have been proposed by Kaplan et al. and recently by Paluch et al., both based on a reduction to maximum asymmetric TSP path (Max-ATSP-Path) and structural results of Breslauer et al. In this paper we give an algorithm that achieves an approximation ratio of 2 11/23, breaking through the long-standing bound of 2 1/2. We use the standard reduction of Shortest-Superstring to Max-ATSP-Path. The new, somewhat surprising, algorithmic idea is to take the better of the two solutions obtained by using: (a) the currently best 2/3-approximation algorithm for Max-ATSP-Path and (b) a naive cycle-cover based 1/2-approximation algorithm. To prove that this indeed results in an improvement, we further develop a theory of string overlaps, extending the results of Breslauer et al. This theory is based on the novel use of Lyndon words, as a substitute for generic unbordered rotations and critical factorizations, as used by Breslauer et al.