Advertisement

Leveraging Linial’s Locality Limit

  • Christoph Lenzen
  • Roger Wattenhofer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

In this paper we extend the lower bound technique by Linial for local coloring and maximal independent sets. We show that constant approximations to maximum independent sets on a ring require at least log-star time. More generally, the product of approximation quality and running time cannot be less than log-star. Using a generalized ring topology, we gain identical lower bounds for approximations to minimum dominating sets. Since our generalized ring topology is contained in a number of geometric graphs such as the unit disk graph, our bounds directly apply as lower bounds for quite a few algorithmic problems in wireless networking.

Having in mind these and other results about local approximations of maximum independent sets and minimum dominating sets, one might think that the former are always at least as difficult to obtain as the latter. Conversely, we show that graphs exist, where a maximum independent set can be determined without any communication, while finding even an approximation to a minimum dominating set is as hard as in general graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Proc. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (2008)Google Scholar
  2. 2.
    Naor, M.: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM Journal on Discrete Mathematics 4(3), 409–412 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the Locality of Bounded Growth. In: Proc. 24th ACM Symposium on the Principles of Distributed Computing (2005)Google Scholar
  4. 4.
    Cole, R., Vishkin, U.: Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Information and Control 70(1), 32–53 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (2006)Google Scholar
  6. 6.
    Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. In: Proc. 22nd ACM Symposium on the Principles of Distributed Computing (2003)Google Scholar
  7. 7.
    Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. Distributed Computing 15(4), 193–205 (2002)CrossRefGoogle Scholar
  8. 8.
    Gfeller, B., Vicari, E.: A Randomized Distributed Algorithm for the Maximal Independent Set Problem in Growth-Bounded Graphs. In: Proc. 26th annual ACM symposium on Principles of distributed computing (2007)Google Scholar
  9. 9.
    Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)Google Scholar
  10. 10.
    Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15(4), 1036–1055 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Naor, M., Stockmeyer, L.: What Can Be Computed Locally? SIAM J. Comput. 24(6), 1259–1277 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Linial, N.: Locality in Distributed Graph Algorithms. SIAM J. Comput. 21(1), 193–201 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally. In: Proc. 23rd annual ACM symposium on Principles of distributed computing (2004)Google Scholar
  14. 14.
    Wiese, A., Kranakis, E.: Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs. In: Proc. 4th IEEE/ACM International Conference on Distributed Computing in Sensor Systems (2008)Google Scholar
  15. 15.
    Czygrinow, A., Hańćkowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Proc. 22nd International Symposium on Distributed Computing (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christoph Lenzen
    • 1
  • Roger Wattenhofer
    • 1
  1. 1.Computer Engineering and Networks Laboratory (TIK)ETH ZurichZurichSwitzerland

Personalised recommendations