A LOWER BOUND ON PROBABILISTIC ALGORITHMS FOR DISTRIBUTIVE RING COLORING

被引：72
|
作者：
NAOR, M
机构：
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1991年 / 4卷 / 03期
关键词：
DISTRIBUTED COMPUTATION; PROBABILISTIC ALGORITHMS; GRAPH COLORING;
D O I：
10.1137/0404036
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Suppose that n processors are arranged in a ring and can communicate only with their immediate neighbors. It is shown that any probabilistic algorithm for 3 coloring the ring must take at least 1/2 log * n - 2 rounds, otherwise the probability that all processors are colored legally is less than 1/2. A similar time bound holds for selecting a maximal independent set. The bound is tight (up to a constant factor) in light of the deterministic algorithms of Cole and Vishkin [Inform. and Control, 70 (1986), pp. 32-53] and extends the lower bound for deterministic algorithms of Linial [Proc. 28th IEEE Foundations of Computer Science Symposium, 1987, pp. 331-335].
引用
收藏
页码：409 / 412
页数：4
相关论文
共 50 条
  • [21] Making Local Algorithms Wait-Free: the Case of Ring Coloring
    Castaneda, Armando
    Delporte-Gallet, Carole
    Fauconnier, Hugues
    Rajsbaum, Sergio
    Raynal, Michel
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (02) : 344 - 365
  • [22] Making Local Algorithms Wait-Free: The Case of Ring Coloring
    Castaneda, Armando
    Delporte, Carole
    Fauconnier, Hugues
    Rajsbaum, Sergio
    Raynal, Michel
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2016, 2016, 10083 : 109 - 125
  • [23] Making Local Algorithms Wait-Free: the Case of Ring Coloring
    Armando Castañeda
    Carole Delporte-Gallet
    Hugues Fauconnier
    Sergio Rajsbaum
    Michel Raynal
    Theory of Computing Systems, 2019, 63 : 344 - 365
  • [24] A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
    Mrad, Mehdi
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    Gharbi, Anis
    IEEE ACCESS, 2020, 8 : 57891 - 57904
  • [25] A Lower Bound for Distributed Averaging Algorithms on the Line Graph
    Olshevsky, Alex
    Tsitsiklis, John N.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (11) : 2694 - 2698
  • [26] Lower-bound result on the power of genetic algorithms
    Park, Kihong
    Australian Electronics Engineering, 1994, 27 (02):
  • [27] A lower bound on approximation algorithms for the closest substring problem
    Wang, Jianxin
    Huang, Min
    Chen, Jianer
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 291 - +
  • [28] Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
    Feldman, Vitaly
    Grigorescu, Elena
    Reyzin, Lev
    Vempala, Santosh S.
    Xiao, Ying
    JOURNAL OF THE ACM, 2017, 64 (02)
  • [29] A LOWER-BOUND FOR RANDOMIZED ONLINE SCHEDULING ALGORITHMS
    CHEN, B
    VANVLIET, A
    WOEGINGER, GJ
    INFORMATION PROCESSING LETTERS, 1994, 51 (05) : 219 - 222
  • [30] A LOWER-BOUND FOR RANDOMIZED LIST UPDATE ALGORITHMS
    TEIA, B
    INFORMATION PROCESSING LETTERS, 1993, 47 (01) : 5 - 9
12345