All instantiations of the greedy algorithm for the shortest superstring problem are equivalent.

Maksim Nikolaev

Published in: CoRR (2021)

Keyphrases

greedy algorithm
greedy algorithms
worst case
objective function
dynamic programming
greedy strategy
greedy heuristic
influence maximization
markov random field
knapsack problem
submodular functions
machine learning
special case
random walk
set cover
approximation guarantees