2021
DOI: 10.48550/arxiv.2111.00721
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Online Edge Coloring via Tree Recurrences and Correlation Decay

Abstract: We give an online algorithm that with high probability computes a e e−1 + o(1) ∆ edge coloring on a graph G with maximum degree ∆ = ω(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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?