The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. - Pavel E. Kalugin; Maksim S. Nikolaev (SOSA, 2024)