Login / Signup
The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring.
Amin Saberi
David Wajc
Published in:
CoRR (2021)
Keyphrases
</>
greedy algorithm
worst case
dynamic programming
greedy heuristic
greedy algorithms
set cover
objective function
randomized algorithm
greedy strategy
approximation guarantees
influence maximization
knapsack problem
edge detection
influence spread
markov chain
upper bound
multiscale
greedy approximation algorithm