Pavel E. Kalugin

According to our database, Pavel E. Kalugin authored at least 1 paper in 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

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

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024