Filters








116 Hits in 2.5 sec

Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization [article]

Václav Rozhoň, Mohsen Ghaffari
2020 arXiv   pre-print
We present a simple polylogarithmic-time deterministic distributed algorithm for network decomposition.  ...  The main implication is a more general distributed derandomization theorem: Put together with the results of Ghaffari, Kuhn, and Maus [STOC'17] and Ghaffari, Harris, and Kuhn [FOCS'18], our network decomposition  ...  The first author also thanks Michael Elkin and Jukka Suomela for very inspiring discussions about network decomposition.  ... 
arXiv:1907.10937v2 fatcat:ztjmsblp3jcjxnt5fq3nrqfkwu

Deterministic Distributed Dominating Set Approximation in the CONGEST Model [article]

Janosch Deurer, Fabian Kuhn, Yannic Maus
2019 arXiv   pre-print
This results in a deterministic O(logΔ)-approximation algorithm for the minimum connected dominating set with time complexity 2^O(√(log n loglog n)).  ...  For ϵ>1/polylogΔ we obtain two algorithms with approximation factor (1+ϵ)(1+ln (Δ+1)) and with runtimes 2^O(√(log n loglog n)) and O(Δ·polylogΔ +polylogΔlog^* n), respectively.  ...  any polylogarithmic approximation for the MDS problem, there are polylogarithmic-time deterministic distributed algorithms for essentially all 4 problems for which there are efficient randomized algorithms  ... 
arXiv:1905.10775v2 fatcat:x4fxbyicrzafhhg73s5mzyj4pq

On Derandomizing Local Distributed Algorithms [article]

Mohsen Ghaffari and David G. Harris and Fabian Kuhn
2019 arXiv   pre-print
The gap between the known randomized and deterministic local distributed algorithms underlies arguably the most fundamental and central open question in distributed graph algorithms.  ...  In this paper, we develop a generic and clean recipe for derandomizing LOCAL algorithms. We also exhibit how this simple recipe leads to significant improvements on a number of problem.  ...  Acknowledgments We would like to thank Janosch Deurer, Manuela Fischer, Juho Hirvonen, Yannic Maus, Jara Uitto, and Simon Weidner for interesting discussions on different aspects of the paper.  ... 
arXiv:1711.02194v4 fatcat:tj5n6xlhf5gt5pptqgvyitadwa

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set

Mohsen Ghaffari, Fabian Kuhn, Michael Wagner
2018 International Symposium on Distributed Computing  
As one main end-result of this derandomized hitting set, we get a deterministic distributed algorithm with round complexity 2 O( √ log n•log log n) for computing a (2k − 1)-spanner of size Õ(n 1+1/k ).  ...  This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for some basic graph problems.  ...  The standard method for (deterministic) algorithms via Network Decomposition.  ... 
doi:10.4230/lipics.disc.2018.29 dblp:conf/wdag/GhaffariK18 fatcat:xjlof5uodzhfrjlpcr2dgnjmhu

Improved Deterministic (Δ+1) Coloring in Low-Space MPC

Artur Czumaj, Peter Davies, Merav Parter
2021 Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing  
This was resolved recently by the groundbreaking network decomposition result of Rozhoň and Ghaffari [40] .  ...  Combining the CLP algorithm with the recent deterministic network decomposition result of Rozhoň and Ghaffari [40] , yields an poly(log log 𝑛)-round algorithm for the (Δ + 1) list coloring problem, which  ...  of [12] , and then explain how to derandomize it within 𝑂 (1) number of rounds.  ... 
doi:10.1145/3465084.3467937 fatcat:owov3x5bcraidkzlstwhti7wmy

Efficient Deterministic Distributed Coloring with Small Bandwidth [article]

Philipp Bamberger, Fabian Kuhn, Yannic Maus
2020 arXiv   pre-print
Using the recent polylogarithmic-time deterministic network decomposition algorithm by Rozhoň and Ghaffari [STOC 2020], this implies the first efficient (i.e., log n-time) deterministic algorithm for the  ...  Previously the best known algorithm required 2^O(√(log n)) rounds and was not based on network decompositions.  ...  Finally, in combination with the new polylogarithmic-time network decomposition algorithm of [RG19] , the running time of the algorithm can be reduced from D · polylog n to only polylog n.  ... 
arXiv:1912.02814v3 fatcat:gwjhbkamubfuhkk4s5qie4gcvy

Efficient CONGEST Algorithms for the Lovasz Local Lemma [article]

Yannic Maus, Jara Uitto
2021 arXiv   pre-print
Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozhon and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozhon [SODA2021  ...  In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.  ...  Acknowledgments This project was partially supported by the European Union's Horizon 2020 Research and Innovation Programme under grant agreement no. 755839 (Yannic Maus).  ... 
arXiv:2108.02638v1 fatcat:cnfe5waaojfc5cggqgyqwvuo7i

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates [article]

Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhoň
2022 arXiv   pre-print
We provide a polylog(n)-round deterministic distributed algorithm that computes a spanner with stretch (2k-1) and O(nk + n^1 + 1/klog k) edges in unweighted graphs and with O(n^1 + 1/k k) edges in weighted  ...  This paper presents efficient distributed algorithms for a number of fundamental problems in the area of graph sparsification: We provide the first deterministic distributed algorithm that computes an  ...  work and polylogarithmic depth, and (3) the reduction from sparse to ultra-sparse can be implemented in near-linear work and polylogarithmic time.  ... 
arXiv:2204.14086v1 fatcat:d7bjpu4flzbllehzaoqcqrtndu

Derandomizing Local Distributed Algorithms under Bandwidth Restrictions [article]

Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
2016 arXiv   pre-print
The best known running time in terms of n alone is 2^O(√( n)), which is super-polylogarithmic, and requires large messages.  ...  This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions.  ...  Acknowledgments: We are very grateful to Mohsen Ghaffari for many helpful discussions and useful observations involving the derandomization of his MIS algorithm.  ... 
arXiv:1608.01689v1 fatcat:twz26utvfbh2petsftqjxdhg2q

Component Stability in Low-Space Massively Parallel Computation

Artur Czumaj, Peter Davies, Merav Parter
2021 Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing  
Rohzoň and Ghaffari [31] settled a several-decadesold open problems by presenting a deterministic polylogarithmic algorithm for network decomposition.  ...  Their result implies that any polylogarithmic-time randomized algorithm for LCL problems [9, 28] can be derandomized to a polylogarithmic-time deterministic algorithm.  ... 
doi:10.1145/3465084.3467903 fatcat:5rqh3vmmlreanlsqnb3nrzs3om

Improved Distributed Fractional Coloring Algorithms [article]

Alkida Balliu, Fabian Kuhn, Dennis Olivetti
2021 arXiv   pre-print
For the standard coloring problem, it is only known that an O(log n/loglog n)-approximation can be computed in polylogarithmic time in the LOCAL model.  ...  In [Bousquet, Esperet, and Pirot; SIROCCO '21], it is shown that in regular grids of bounded dimension, a fractional (2+ϵ)-coloring can be computed in time O(log^* n).  ...  Polylogarithmic-time deterministic network decomposition and distributed derandomization.  ... 
arXiv:2112.04405v2 fatcat:szjicm6cnng6rhahcedqli6iya

A tight bound on approximating arbitrary metrics by tree metrics

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2003 Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03  
This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buy-at-bulk network design and metrical task system.  ...  In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is Oðlog nÞ: This improves upon the result  ...  Acknowledgments We thank Yair Bartal for helpful comments on a previous draft of the paper, and for pointing us to several of the aforementioned applications.  ... 
doi:10.1145/780542.780608 dblp:conf/stoc/FakcharoenpholRT03 fatcat:zbl7ctycrzdcpkaonsjzm46xea

A tight bound on approximating arbitrary metrics by tree metrics

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2003 Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03  
This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buy-at-bulk network design and metrical task system.  ...  In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is Oðlog nÞ: This improves upon the result  ...  Acknowledgments We thank Yair Bartal for helpful comments on a previous draft of the paper, and for pointing us to several of the aforementioned applications.  ... 
doi:10.1145/780606.780608 fatcat:cmkihdtwpbe53frr5aifids7wu

A tight bound on approximating arbitrary metrics by tree metrics

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2004 Journal of computer and system sciences (Print)  
This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buy-at-bulk network design and metrical task system.  ...  In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is Oðlog nÞ: This improves upon the result  ...  Acknowledgments We thank Yair Bartal for helpful comments on a previous draft of the paper, and for pointing us to several of the aforementioned applications.  ... 
doi:10.1016/j.jcss.2004.04.011 fatcat:6blzko5t4fhifbqs2v4jtxkp7e

Distance-2 Coloring in the CONGEST Model [article]

Magnus M. Halldorsson, Fabian Kuhn, Yannic Maus
2020 arXiv   pre-print
We give efficient randomized and deterministic distributed algorithms for computing a distance-2 vertex coloring of a graph G in the CONGEST model.  ...  Further if the number of colors is slightly increased to (1+ϵ)Δ^2 for some ϵ>1/ polylog(n), we show that it is even possible to compute a distance-2 coloring deterministically in polylog(n) time in the  ...  We show that this algorithm can be derandomized with a network decomposition of G 2 . Formally, we solve the following more general version of the problem efficiently and deterministically.  ... 
arXiv:2005.06528v1 fatcat:erk36zl335fuzfuskax6x42gna
« Previous Showing results 1 — 15 out of 116 results