Maksim S. Nikolaev

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 2

Top Topics

Knapsack Problem

Greedy Algorithms

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)
Maksim S. Nikolaev
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent. SPIRE (2021)