Online Edge Coloring Algorithms via the Nibble Method

10/30/2020
by   Sayan Bhattacharya, et al.
0

Nearly thirty years ago, Bar-Noy, Motwani and Naor [IPL'92] conjectured that an online (1+o(1))Δ-edge-coloring algorithm exists for n-node graphs of maximum degree Δ=ω(log n). This conjecture remains open in general, though it was recently proven for bipartite graphs under one-sided vertex arrivals by Cohen et al. [FOCS'19]. In a similar vein, we study edge coloring under widely-studied relaxations of the online model. Our main result is in the random-order online model. For this model, known results fall short of the Bar-Noy et al. conjecture, either in the degree bound [Aggarwal et al. FOCS'03], or number of colors used [Bahmani et al. SODA'10]. We achieve the best of both worlds, thus resolving the Bar-Noy et al. conjecture in the affirmative for this model. Our second result is in the adversarial online (and dynamic) model with recourse. A recent algorithm of Duan et al. [SODA'19] yields a (1+ϵ)Δ-edge-coloring with poly(log n/ϵ) recourse. We achieve the same with poly(1/ϵ) recourse, thus removing all dependence on n. Underlying our results is one common offline algorithm, which we show how to implement in these two online models. Our algorithm, based on the Rödl Nibble Method, is an adaptation of the distributed algorithm of Dubhashi et al. [TCS'98]. The Nibble Method has proven successful for distributed edge coloring. We display its usefulness in the context of online algorithms.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/19/2019

Tight Bounds for Online Edge Coloring

Vizing's celebrated theorem asserts that any graph of maximum degree Δ a...
01/02/2019

Towards the Locality of Vizing's Theorem

Vizing showed that it suffices to color the edges of a simple graph usin...
11/01/2021

Online Edge Coloring via Tree Recurrences and Correlation Decay

We give an online algorithm that with high probability computes a (e/e-1...
01/07/2018

Local search algorithms for wireless mesh networks

In a multi-channel Wireless Mesh Networks (WMN), each node is able to us...
05/14/2021

The Greedy Algorithm is not Optimal for On-Line Edge Coloring

Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no onlin...
07/10/2020

A Causal Linear Model to Quantify Edge Unfairness for Unfair Edge Prioritization and Discrimination Removal

The dataset can be generated by an unfair mechanism in numerous settings...
03/02/2020

Connected Components on a PRAM in Log Diameter Time

We present an O(log d + loglog_m/n n)-time randomized PRAM algorithm for...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.