Optimal Online Edge Coloring of Planar Graphs with Advice
Jesper W. Mikkelsen

TL;DR
This paper investigates the amount of future knowledge needed for online edge coloring of graphs, showing that bounded degeneracy graphs require linear advice, while bipartite graphs need advice proportional to their maximum degree for optimal coloring.
Contribution
It establishes bounds on advice complexity for optimal online edge coloring in various graph classes, including bounded degeneracy and bipartite graphs.
Findings
Bounded degeneracy graphs need only O(m) advice bits for optimal coloring.
Achieving better than no-advice competitive ratio requires Ω(m) advice bits.
Bipartite graphs require Ω(m log Δ) advice bits for optimal coloring with fixed advice per edge.
Abstract
Using the framework of advice complexity, we study the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally, i.e., using as few colors as possible. For graphs of maximum degree , it follows from Vizing's Theorem that bits of advice suffice to achieve optimality, where is the number of edges. We show that for graphs of bounded degeneracy (a class of graphs including e.g. trees and planar graphs), only bits of advice are needed to compute an optimal solution online, independently of how large is. On the other hand, we show that bits of advice are necessary just to achieve a competitive ratio better than that of the best deterministic online algorithm without advice. Furthermore, we consider algorithms which use a fixed number of advice bits per edge (our algorithm for graphs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Advanced Graph Theory Research · Complexity and Algorithms in Graphs
