The Greedy Algorithm Is not Optimal for On-Line Edge Coloring.
Amin SaberiDavid WajcPublished in: ICALP (2021)
Keyphrases
- greedy algorithm
- worst case
- dynamic programming
- greedy heuristic
- greedy algorithms
- approximation guarantees
- objective function
- knapsack problem
- greedy strategy
- set cover
- randomized algorithm
- influence maximization
- np hard
- greedy approximation algorithm
- social networks
- social interaction
- lower bound
- permutation flowshop
- optimal solution