A classic theorem by Vizing asserts that if the maximum degree of a graph is Δ, then it is possible to color its edges, in polynomial time, using at most Δ+1 colors.
Here, a natural model is that edges arrive online, but in a random
SPECIAL ISSUE IN HONOR OF RAJEEV MOTWANI. Online Graph Edge- Coloring in the. Random-Order Arrival Model. ∗. Bahman Bahmani. †.
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. Bahman Bahmani; Aranyak Mehta; Rajeev Motwani.
We note that the random order arrival model can simply be considered as an algorithmic technique for fast offline approxima- tion: randomly permute the edges ...
Request PDF | A 1.43-Competitive Online Graph Edge Coloring Algorithm In The Random Order Arrival Model | A classic theorem by Vizing ...
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model. B Bahmani, A Mehta, R Motwani. Proceedings of the Twenty-First ...
Bahmani, B., Mehta, A., and Motwani, R. 2012. Online graph edge-coloring in the randomorder arrival model. Theory of Computing (conference ...
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model. B Bahmani, A Mehta, R Motwani. Proceedings of the Twenty-First ...
edge- coloring is possible for graphs with ∆ = ω(log n).