Additionally, we give a new algorithm for approximating the coloring numbers which improves both the runtime and approximation guarantees given by the approach of Dvořák [1]}.
The algorithm applies a greedy strategy directly to the coloring numbers rather than using admissibility as an intermediary.
