[1]
D. Bongartz, “On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem”,
Comput. Inform.
, vol. 20, no. 4, pp. 325–357, Feb. 2012.