تقرير
Online Edge Coloring via Tree Recurrences and Correlation Decay
| العنوان: | Online Edge Coloring via Tree Recurrences and Correlation Decay |
|---|---|
| المؤلفون: | Kulkarni, Janardhan, Liu, Yang P., Sah, Ashwin, Sawhney, Mehtaab, Tarnawski, Jakub |
| سنة النشر: | 2021 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Data Structures and Algorithms |
| الوصف: | We give an online algorithm that with high probability computes a $\left(\frac{e}{e-1} + o(1)\right)\Delta$ edge coloring on a graph $G$ with maximum degree $\Delta = \omega(\log n)$ under online edge arrivals against oblivious adversaries, making first progress on the conjecture of Bar-Noy, Motwani, and Naor in this general setting. Our algorithm is based on reducing to a matching problem on locally treelike graphs, and then applying a tree recurrences based approach for arguing correlation decay. Comment: 22 pages, 1 figure |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2111.00721 |
| رقم الأكسشن: | edsarx.2111.00721 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |