The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof.
Pavel E. KaluginMaksim S. NikolaevPublished in: SOSA (2024)
Keyphrases
- greedy algorithm
- approximation guarantees
- influence spread
- approximation ratio
- objective function
- submodular functions
- randomized algorithm
- greedy strategy
- influence maximization
- greedy heuristic
- greedy algorithms
- dynamic programming
- worst case
- set cover
- shortest common supersequence
- image compression
- machine learning
- web search engines
- computational complexity
- greedy approximation algorithm
- social networks