A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model

Bahman Bahmani, Aranyak Mehta, Rajeev Motwani. A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 31-39, SIAM, 2010. [doi]

@inproceedings{BahmaniMM10,
  title = {A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model},
  author = {Bahman Bahmani and Aranyak Mehta and Rajeev Motwani},
  year = {2010},
  url = {http://www.siam.org/proceedings/soda/2010/SODA10_004_bahmanib.pdf},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BahmaniMM10},
  cites = {0},
  citedby = {0},
  pages = {31-39},
  booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010},
  editor = {Moses Charikar},
  publisher = {SIAM},
}