Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
TLDR
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced.Abstract:
Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring problems We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation Our algorithms compute an edge coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $16 \Delta + O(\log^{1+ \delta} n)$ colors with high probability (arbitrarily close to 1) for any fixed $\delta > 0$; they run in polylogarithmic time The upper bound on the number of colors improves upon the $(2 \Delta - 1)$-coloring achievable by a simple reduction to vertex coloring
To analyze the performance of our algorithms, we introduce new techniques for proving upper bounds on the tail probabilities of certain random variables The Chernoff--Hoeffding bounds are fundamental tools that are used very frequently in estimating tail probabilities However, they assume stochastic independence among certain random variables, which may not always hold Our results extend the Chernoff--Hoeffding bounds to certain types of random variables which are not stochastically independent We believe that these results are of independent interest and merit further studyread more
Citations
More filters
Posted Content
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
TL;DR: In this article, it was shown that the space complexity of single-pass streaming algorithms for approximating the classic set cover problem is polynomial in the number of sets and the size of the universe.
Book ChapterDOI
Distributed edge coloration for bipartite networks
Shing-Tsaan Huang,Chi-Hung Tzeng +1 more
TL;DR: A distributed algorithm to color the edges of a bipartite network in such a way that any two adjacent edges receive distinct colors has the self-stabilizing property.
Posted Content
Fillable arrays with constant time operations and a single bit of redundancy
TL;DR: It is shown that with just one bit of redundancy, a data structure using $nw+1$ bits of memory can be implemented in worst case constant time and implemented in either amortized constant time (deterministically) or worst case expected constant (randomized).
Posted Content
Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions
TL;DR: The first separation in the approximation guarantee achievable by truthful and non-truthful combinatorial auctions with polynomial communication was shown in this paper, where it was shown that any truthful mechanism guaranteeing a 3-4-1-240 + ε-varepsilon-approximation for two buyers with XOS valuations over $m$ items requires communication.
Posted Content
An algorithmic framework for colouring locally sparse graphs
TL;DR: An algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets is developed and a randomised polynomial-time algorithm is given for colouring graphs of maximum degree ∆ in which each vertex is contained in at most t copies of a cycle of length k.
References
More filters
Book ChapterDOI
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Journal ArticleDOI
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Journal ArticleDOI
Locality in distributed graph algorithms
TL;DR: This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.