1 paper
Joakim Blikstad, Ola Svensson, Radu Vintan +1
We study online bipartite edge coloring, with nodes on one side of the graph revealed sequentially. The trivial greedy algorithm is (2−o(1))-competitive, which is optimal for gra…