Pavel E. Kalugin

Publication Activity (10 Years)

Years Active: 2024-2024
Publications (10 Years): 1

Top Topics

Approximation Guarantees

Influence Spread

Submodular Functions

Top Venues

Publications

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