Median bounds and their application
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Soft Path Coloring
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Talagrand's Inequality and Locality in Distributed Computing
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Equitable Coloring Extends Chernoff-Hoeffding Bounds
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Learning theory and language modeling
Exploring artificial intelligence in the new millennium
Parallel I/O scheduling using randomized, distributed edge coloring algorithms
Journal of Parallel and Distributed Computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Distributed approximation: a survey
ACM SIGACT News
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Scheduling DAGs on asynchronous processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Journal of Complexity
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The Local Nature of List Colorings for Graphs of High Girth
SIAM Journal on Computing
Structure-aware sampling on data streams
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Structure-aware sampling on data streams
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Convergence Rates of Efficient Global Optimization Algorithms
The Journal of Machine Learning Research
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
SIAM Journal on Computing
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
New bounds for motif finding in strong instances
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fast algorithms for the free riders problem in broadcast encryption
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Interviewing secretaries in parallel
Proceedings of the 13th ACM Conference on Electronic Commerce
Sublinear optimization for machine learning
Journal of the ACM (JACM)
Dynamic covering for recommendation systems
Proceedings of the 21st ACM international conference on Information and knowledge management
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
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 $1.6 \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 study.