# Distributed algorithms for fractional coloring

1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It is known that for every real $\alpha>1$ and integer $\Delta$, a fractional coloring of total weight at most $\alpha(\Delta+1)$ can be obtained deterministically in a single round in graphs of maximum degree $\Delta$, in the LOCAL model of computation. However, a major issue of this result is that the output of each vertex has unbounded size. Here we prove that even if we impose the more realistic assumption that the output of each vertex has constant size, we can find fractional colourings with a weight arbitrarily close to known tight bounds for the fractional chromatic number in several cases of interest. Moreover, we improve on classical bounds on the chromatic number by considering the fractional chromatic number instead, without significantly increasing the output size and the round complexity of the existing algorithms.
Document type :
Conference papers
Domain :

https://hal.archives-ouvertes.fr/hal-03039896
Contributor : Louis Esperet Connect in order to contact the contributor
Submitted on : Friday, December 4, 2020 - 9:47:44 AM
Last modification on : Tuesday, January 4, 2022 - 5:46:10 AM

### Citation

Nicolas Bousquet, Louis Esperet, François Pirot. Distributed algorithms for fractional coloring. 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021), Jun 2021, Wroclaw, Poland. pp.15-30, ⟨10.1007/978-3-030-79527-6_2⟩. ⟨hal-03039896⟩

### Metrics

Les métriques sont temporairement indisponibles