Survey of local algorithms

ACM Computing Surveys

Volumn 45, Issue 2, 2013, Pages

  Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Local algorithms

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS;

CONSTANT TIME; DETERMINISTICS; FAULT-TOLERANT; GEOMETRIC GRAPHS; IMPOSSIBILITY RESULTS; LARGE-SCALE DISTRIBUTED SYSTEM; LOCAL ALGORITHM; STATE OF THE ART;

SURVEYS;

EID: 84875142024     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2431211.2431223     Document Type: Review

References (151)

1. AARONSON, S., KUPERBERG, G., AND GRANADE, C. 2011. Complexity zoo. http://www.complexityzoo.com/
2. ALLAN, R. B. AND LASKAR, R. 1978. On domination and independent domination numbers of a graph. Discrete Math. 23, 2, 73-76
3. ALON, N., BABAI, L., AND ITAI, A. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algor. 7, 4, 567-583
4. AMIT, A., LINIAL, N., MATOU?SEK, J., AND ROZENMAN, E. 2001. Random lifts of graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 883-894
5. ANGLUIN, D. 1980. Local and global properties in networks of processors. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York, 82-93
6. APPLEBAUM, B., ISHAI, Y., AND KUSHILEVITZ, E. 2006. Cryptography in NC0. SIAM J. Comput. 36, 4, 845-888
7. ASTRAND, M., FLORéEN, P., POLISHCHUK, V., RYBICKI, J., SUOMELA, J., AND UITTO, J. 2009. A local 2-approximation algorithm for the vertex cover problem. In Proceedings of the 23rd International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 5805, Springer, 191-205
8. ASTRAND, M., POLISHCHUK, V., RYBICKI, J., SUOMELA, J., AND UITTO, J. 2010. Local algorithms in (weakly) coloured graphs. arXiv:1002.0125 [cs.DC]
9. ASTRAND, M. AND SUOMELA, J. 2010. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 294-302
10. ATTIYA, H., SHACHNAI, H., AND TAMIR, T. 1999. Local labeling and resource allocation using preprocessing. SIAM J. Comput. 28, 4, 1397-1413
11. ATTIYA, H., SNIR, M., AND WARMUTH, M. K. 1988. Computing on an anonymous ring. J. ACM 35, 4, 845-875
12. AUSIELLO, G., CRESCENZI, P., GAMBOSI, G., KANN, V., MARCHETTI-SPACCAMELA, A., AND PROTASI, M. 2003. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer
13. AWERBUCH, B., GOLDBERG, A. V., LUBY, M., AND PLOTKIN, S. A. 1989. Network decomposition and locality in distributed computation. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 364-369 (Pubitemid 20725973)
14. AWERBUCH, B. AND SIPSER, M. 1988. Dynamic networks are as fast as static networks. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 206-219
15. AWERBUCH, B. AND VARGHESE, G. 1991. Distributed program checking: A paradigm for building self-stabilizing distributed protocols. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 258-267
16. BARENBOIM, L. AND ELKIN, M. 2009. Distributed (- + 1)-coloring in linear (in-) time. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 111-120
17. BARRIèRE, L., FRAIGNIAUD, P., NARAYANAN, L., AND OPATRNY, J. 2003. Robust position-based routing in wireless ad-hoc networks with irregular transmission ranges.Wirel. Comm. Mobile Comput. J. 3, 2, 141-153 (Pubitemid 40183734)
18. BARTAL, Y., BYERS, J. W., AND RAZ, D. 1997. Global optimization using local information with applications to flow control. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, 303-312
19. BOLDI, P. AND VIGNA, S. 2001. An effective characterization of computability in anonymous networks. In Proceedings of the 15th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 2180, Springer, 33-47
20. BOSE, P., MORIN, P., STOJMENOVI C, I., AND URRUTIA, J. 2001. Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7, 6, 609-616 (Pubitemid 33091058)
21. BOTTREAU, A. ANDMé TIVIER, Y. 1996. The Kronecker product and local computations in graphs. In Proceedings of the 21st International Colloquium on Trees in Algebra and Programming (CAAP). Lecture Notes in Computer Science, vol. 1059, Springer, 2-16 (Pubitemid 126064259)
22. CARDEI, M., MACCALLUM, D., CHENG, M. X., MIN, M., JIA, X., LI, D., AND DU, D.-Z. 2002.Wireless sensor networks with energy efficient organization. J. Interconnection Netw. 3, 3-4, 213-229
23. CHáVEZ, E., DOBREV, S., KRANAKIS, E., OPATRNY, J., STACHO, L., AND URRUTIA, J. 2006. Local construction of planar spanners in unit disk graphs with irregular transmission ranges. In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN). Lecture Notes in Computer Science, vol. 3887, Springer, 286-297 (Pubitemid 43986614)
24. CHLEBíK, M. AND CHLEBíKOVá, J. 2006. Approximation hardness of edge dominating set problems. J. Combin. Optim. 11, 3, 279-290 (Pubitemid 43724062)
25. COCKAYNE, E. J. AND HEDETNIEMI, S. T. 1975. Optimal domination in graphs. IEEE Trans. Circ. Syst. 22, 11, 855-857
26. COLE, R. AND VISHKIN, U. 1986. Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70, 1, 32-53 (Pubitemid 17511516)
27. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. The MIT Press, Cambridge, MA
28. CRYAN, M. AND MILTERSEN, P. B. 2001. On pseudorandom generators in NC0. In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 2136, Springer, 272-284
29. CZYGRINOW, A., HAŃCKOWIAK, M., KRZYWDZÍ NSKI, K., SZYMáNSKA, E., AND WAWRZYNIAK, W. 2011. Brief announcement: Distributed approximations for the semi-matching problem. In Proceedings of the 25th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 6950, Springer, 200-201
30. CZYGRINOW, A., HáŃCKOWIAK, M., AND WAWRZYNIAK, W. 2008. Fast distributed approximations in planar graphs. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 5218, Springer, 78-92
31. CZYZOWICZ, J., DOBREV, S., FEVENS, T., GONZáLEZ-AGUILAR, H., KRANAKIS, E., OPATRNY, J., AND URRUTIA, J. 2008 Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. In Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN). Lecture Notes in Computer Science, vol. 4957, Springer, 158-169
32. CZYZOWICZ, J., DOBREV, S., GONZáLEZ-AGUILAR, H., KRáLOVI ?C, R., KRANAKIS, E., OPATRNY, J., STACHO, L., AND URRUTIA, J. 2011. Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412, 18, 1696-1704
33. CZYZOWICZ, J., DOBREV, S., KRANAKIS, E., OPATRNY, J., AND URRUTIA, J. 2009. Local edge colouring of Yao-like subgraphs of unit disk graphs. Theor. Comput. Sci. 410, 14, 1388-1400
34. DIESTEL, R. 2005. Graph Theory 3rd Ed. Springer.
35. DIJKSTRA, E. W. 1974. Self-stabilizing systems in spite of distributed control. Comm. ACM 17, 11, 643-644
36. DOLEV, S. 2000. Self-Stabilization. The MIT Press, Cambridge, MA
37. DOYLE, P. G. AND SNELL, J. L. 1984. Random Walks and Electric Networks. Number 22 in The Carus Mathematical Monographs. The Mathematical Association of America, Washington, DC
38. ELKIN, M. 2004. Distributed approximation: A survey. ACM SIGACT News 35, 4, 40-57
39. EPPSTEIN, D., GALIL, Z., AND ITALIANO, G. F. 1999. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, M. J. Atallah, Ed., CRC Press, Boca Raton, FL, Chapter 8
40. FEIGE, U., HALLDóRSSON, M. M., KORTSARZ, G., AND SRINIVASAN, A. 2002. Approximating the domatic number. SIAM J. Comput. 32, 1, 172-195
41. FICH, F. AND RUPPERT, E. 2003. Hundreds of impossibility results for distributed computing. Distrib. Comput. 16, 2-3, 121-163
42. FLORéEN, P., HASSINEN, M., KAASINEN, J., KASKI, P., MUSTO, T., AND SUOMELA, J. 2011. Local approximability of max-min and min-max linear programs. Theory Comput. Syst. 49, 4, 672-697
43. FLORéEN, P., HASSINEN, M., KASKI, P., AND SUOMELA, J. 2008a. Local approximation algorithms for a class of 0/1 max-min linear programs. arXiv:0806.0282 [cs.DC]
44. FLORéEN, P., HASSINEN, M., KASKI, P., AND SUOMELA, J. 2008b. Tight local approximation results for max-min linear programs. In Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks. Lecture Notes in Computer Science, vol. 5389, Springer, 2-17
45. FLORéEN, P., KAASINEN, J., KASKI, P., AND SUOMELA, J. 2009. An optimal local approximation algorithm for maxmin linear programs. In Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 260-269
46. FLORéEN, P., KASKI, P., MUSTO, T., AND SUOMELA, J. 2008c. Approximating max-min linear programs with local algorithms. In Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE
47. FLORéEN, P., KASKI, P., MUSTO, T., AND SUOMELA, J. 2008d. Local approximation algorithms for scheduling problems in sensor networks. In Proceedings of the 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks. Lecture Notes in Computer Science, vol. 4837, Springer, 99-113
48. FLORéEN, P., KASKI, P., POLISHCHUK, V., AND SUOMELA, J. 2010. Almost stable matchings by truncating the Gale-Shapley algorithm. Algorithmica 58, 1, 102-118
49. FLORéEN, P., KASKI, P., AND SUOMELA, J. 2007. A distributed approximation scheme for sleep scheduling in sensor networks. In Proceedings of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON). IEEE, 152-161
50. FRAIGNIAUD, P., GAVOILLE, C., ILCINKAS, D., AND PELC, A. 2007. Distributed computing with advice: Information sensitivity of graph coloring. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4596, Springer, 231-242
51. FRAIGNIAUD, P., KORMAN, A., AND PELEG, D. 2011. Local distributed decision. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA. (to appear)
52. FUJITO, T. AND NAGAMOCHI, H. 2002. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discr. Appl. Math. 118, 3, 199-207
53. GABRIEL, K. R. AND SOKAL, R. R. 1969. A new statistical approach to geographic variation analysis. Syst. Zool. 18, 3, 259-278
54. GALE, D. AND SHAPLEY, L. S. 1962. College admissions and the stability of marriage. Amer. Math. Month. 69, 1, 9-15
55. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman and Company, New York
56. GASIENIEC, L., SU, C., ANDWONG, P. 2008. Routing in geometric networks. In Encyclopedia of Algorithms, M.-Y. Kao, Ed., Springer, New York
57. GIBBONS, P. B. 2008. Fun with networks: Social, sensor, and shape shifting. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC)
58. GODSIL, C. AND ROYLE, G. 2004. Algebraic Graph Theory. Graduate Texts in Mathematics Series, vol. 207, Springer, New York
59. GOLDBERG, A. V., PLOTKIN, S. A., AND SHANNON, G. E. 1988. Parallel symmetry-breaking in sparse graphs. SIAM J. Discr. Math. 1, 4, 434-446
60. Gö̈OS, M. AND SUOMELA, J. 2011. Locally checkable proofs. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 159-168
61. GRAHAM, R. L., ROTHSCHILD, B. L., AND SPENCER, J. H. 1980. Ramsey Theory. John Wiley & Sons, New York
62. GUSFIELD, D. AND IRVING, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. Foundations of Computing. The MIT Press, Cambridge, MA
63. HAJEK, B. AND SASAKI, G. 1988. Link scheduling in polynomial time. IEEE Trans. Inf. Theory 34, 5, 910-917
64. HáŃCKOWIAK, M., KARó NSKI, M., AND PANCONESI, A. 1998. On the distributed complexity of computing maximal matchings. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 219-225
65. HáŃCKOWIAK, M., KARó NSKI, M., AND PANCONESI, A. 2001. On the distributed complexity of computing maximal matchings. SIAM J. Discr. Math. 15, 1, 41-57
66. HARVEY, N. J. A., LADNER, R. E., LOVáSZ, L., AND TAMIR, T. 2006. Semi-matchings for bipartite graphs and load balancing. J. Algor. 59, 1, 53-78
67. HASSINEN, M., KAASINEN, J., KRANAKIS, E., POLISHCHUK, V., SUOMELA, J., AND WIESE, A. 2011. Analysing local algorithms in location-aware quasi-unit-disk graphs. Discr. Appl. Math. 159, 15, 1566-1580
68. HASSINEN, M., POLISHCHUK, V., AND SUOMELA, J. 2008. Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs. In Proceedings of the 2nd International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS). V.9-V.12
69. HASTAD, J. 1987. One-way permutations in NC0. Inf. Process. Lett. 26, 3, 153-155
70. HOCHBAUM, D. S. 1982. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 3, 555-556
71. HOCKING, J. G. AND YOUNG, G. S. 1961. Topology. Addison-Wesley, Reading, MA
72. HOEPMAN, J.-H., KUTTEN, S., AND LOTKER, Z. 2006. Efficient distributed weighted matchings on trees. In Proceedings of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science, vol. 4056, Springer, 115-129 (Pubitemid 44113041)
73. HOORY, S. 2002. On graphs of high girth. Ph.D. thesis, Hebrew University, Jerusalem. HUNT, H. B., III, MARATHE, M. V., RADHAKRISHNAN, V., RAVI, S. S., ROSENKRANTZ, D. J., AND STEARNS, R. E. 1998
74. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algor. 26, 2, 238-274
75. IMRICH, W. AND PISANSKI, T. 2008. Multiple Kronecker covering graphs. Euro. J. Combin. 29, 5, 1116-1122
76. ISRAELI, A. AND ITAI, A. 1986. A fast and simple randomized parallel algorithm for maximal matching. Inf. Process. Lett. 22, 2, 77-80 (Pubitemid 16519166)
77. JAIN, K., PADHYE, J., PADMANABHAN, V. N., AND QIU, L. 2005. Impact of interference on multi-hop wireless network performance. Wirel. Netw. 11, 4, 471-487 (Pubitemid 41067732)
78. JAROMCZYK, J. W. AND TOUSSAINT, G. T. 1992. Relative neighborhood graphs and their relatives. Proc. IEEE 80, 9, 1502-1517
79. JOHNSON, D. S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256-278
80. JOHNSON, R. E. AND SCHNEIDER, F. B. 1985. Symmetry and similarity in distributed systems. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 13-22
81. KANJ, I. A., PERKOVÍC, L., AND XIA, G. 2008. Computing lightweight spanners locally. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 5218, Springer, 365-378
82. KASKI, P., PENTTINEN, A., AND SUOMELA, J. 2008. Coordinating concurrent transmissions: A constant factor approximation of maximum-weight independent set in local conflict graphs. Ad Hoc Sensor Wirel. Netw.: Int. J. 6, 3-4, 239-263
83. KEIL, J. M. AND GUTWIN, C. A. 1992. Classes of graphs which approximate the complete Euclidean graph. Discr. Comput. Geom. 7, 1, 13-28
84. KORMAN, A. ANDKUTTEN, S. 2006. On distributed verification. In Proceedings of the 8th International Conference on Distributed Computing and Networking (ICDCN). Lecture Notes in Computer Science, vol. 4308, Springer, 100-114
85. KORMAN, A. AND KUTTEN, S. 2007. Distributed verification of minimum spanning trees. Distrib. Comput. 20, 4, 253-266 (Pubitemid 350005916)
86. KORMAN, A., KUTTEN, S., AND PELEG, D. 2005. Proof labeling schemes. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 9-18 (Pubitemid 43218364)
87. KORMAN, A., PELEG, D., AND RODEH, Y. 2010. Constructing labeling schemes through universal matrices. Algorithmica 57, 4, 641-652
88. KORTE, B. AND VYGEN, J. 2006. Combinatorial Optimization: Theory and Algorithms, 3rd Ed., Springer.
89. KRANAKIS, E., SINGH, H., AND URRUTIA, J. 1999. Compass routing on geometric networks. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG)
90. KRISHNAMACHARI, B. 2005. Networking Wireless Sensors. Cambridge University Press, Cambridge, UK.
91. KUHN, F. 2005. The price of locality: Exploring the complexity of distributed coordination primitives. Ph.D. thesis, ETH Zurich
92. KUHN, F. 2008. Local approximation of covering and packing problems. In Encyclopedia of Algorithms, M.-Y. Kao, Ed., Springer
93. KUHN, F. 2009. Weak graph colorings: Distributed algorithms and applications. In Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 138-144
94. KUHN, F. AND MOSCIBRODA, T. 2007. Distributed approximation of capacitated dominating sets. In Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 161-170 (Pubitemid 47568565)
95. KUHN, F., MOSCIBRODA, T., AND WATTENHOFER, R. 2004. What cannot be computed locally! In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 300-309
96. KUHN, F., MOSCIBRODA, T., AND WATTENHOFER, R. 2005. On the locality of bounded growth. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 60-68 (Pubitemid 43218371)
97. KUHN, F., MOSCIBRODA, T., ANDWATTENHOFER, R. 2006a. Fault-tolerant clustering in ad hoc and sensor networks. In Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press.
98. KUHN, F., MOSCIBRODA, T., AND WATTENHOFER, R. 2006b. The price of being near-sighted. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM Press, 980-989 (Pubitemid 43275324)
99. KUHN, F., MOSCIBRODA, T., AND WATTENHOFER, R. 2006c. The price of being near-sighted. Tech. rep. 229, ETH Zurich, Computer Engineering and Networks Laboratory
100. KUHN, F., MOSCIBRODA, T., AND WATTENHOFER, R. 2010. Local computation: Lower and upper bounds. arXiv:1011.5470 [cs.DC]
101. KUHN, F. AND WATTENHOFER, R. 2005. Constant-time distributed dominating set approximation. Distrib. Comput. 17, 4, 303-310 (Pubitemid 40666262)
102. KUHN, F., WATTENHOFER, R., AND ZOLLINGER, A. 2008. Ad hoc networks beyond unit disk graphs. Wirel. Netw. 14, 5, 715-729
103. LENZEN, C. 2011. Synchronization and symmetry breaking in distributed systems. Ph.D. thesis, ETH Zurich
104. LENZEN, C., OSWALD, Y. A., AND WATTENHOFER, R. 2010. What can be approximated locally? TIK rep. 331, ETH Zurich, Computer Engineering and Networks Laboratory
105. LENZEN, C., SUOMELA, J., AND WATTENHOFER, R. 2009. Local algorithms: Self-stabilization on speed. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science, vol. 5873, Springer, 17-34
106. LENZEN, C. AND WATTENHOFER, R. 2008. Leveraging Linial's locality limit. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 5218, Springer, 394-407
107. LENZEN, C. AND WATTENHOFER, R. 2010. Minimum dominating set approximation in graphs of bounded arboricity. In Proceedings of the 24th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 6343, Springer, 510-524
108. LI, X.-Y., WANG, Y., AND SONG, W.-Z. 2004. Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks. IEEE Trans. Parall. Distrib. Syst. 15, 12, 1057-1069 (Pubitemid 40043373)
109. LINIAL, N. 1992. Locality in distributed graph algorithms. SIAM J. Comput. 21, 1, 193-201
110. LOVáSZ, L. 2008. Very large graphs. arXiv:0902.0132 [math.CO]. LUBY, M. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 4, 1036-1053
111. LUBY, M. 1993. Removing randomness in parallel computation without a processor penalty. J. Comput. Syst. Sci. 47, 2, 250-286
112. LUBY, M. AND NISAN, N. 1993. A parallel approximation algorithm for positive linear programming. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 448-457 (Pubitemid 23668751)
113. LYNCH, N. A. 1989. A hundred impossibility proofs for distributed computing. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 1-28
114. MAYER, A., NAOR, M., AND STOCKMEYER, L. 1995. Local computations on static and dynamic graphs. In Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS). IEEE, 268-278
115. MITZENMACHER, M. AND UPFAL, E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge, UK
116. MOSCIBRODA, T. 2006. Locality, scheduling, and selfishness: Algorithmic foundations of highly decentralized networks. Ph.D. thesis, ETH Zurich
117. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK
118. MUNKRES, J. R. 2000. Topology 2nd Ed., Prentice Hall, Upper Saddle River, NJ
119. NAOR, M. 1991. A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discr. Math. 4, 3, 409-412
120. NAOR, M. AND STOCKMEYER, L. 1995. What can be computed locally? SIAM J. Comput. 24, 6, 1259-1277
121. NGUYEN, H. N. AND ONAK, K. 2008. Constant-time approximation algorithms via local improvements. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, 327-336
122. PAPADIMITRIOU, C. H. AND STEIGLITZ, K. 1998. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Inc., Mineola, NY
123. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1991. On the value of information in distributed decision-making. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 61-64
124. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1993. Linear programming without the matrix. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 121-129
125. PARNAS, M. AND RON, D. 2007. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381, 1-3, 183-196 (Pubitemid 47126208)
126. PELEG, D. 2000. Distributed Computing-A Locality-Sensitive Approach. SIAM, Philadelphia, PA.
127. POLISHCHUK, V. AND SUOMELA, J. 2009. A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett. 109, 12, 642-645
128. RAMSEY, F. P. 1930. On a problem of formal logic. Proc.London Math. Soc. 30, 264-286
129. SCHNEIDER, J. AND WATTENHOFER, R. 2008. A log-star distributed maximal independent s et algorithm for growth-bounded graphs. In Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 35-44
130. SCHNEIDER, M. 1993. Self-stabilization. ACM Comput. Surv. 25, 1, 45-67
131. ?SPARL, P. AND ?Z EROVNIK, J. 2005. 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algor. 55, 1, 29-41 (Pubitemid 40357143)
132. STERLING, A. D. 2008. A limit to the power of multiple nucleation in self-assembly. In Proceedings of the 22nd International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 5218, Springer, 451-465
133. SUOMELA, J. 2010. Distributed algorithms for edge dominating sets. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 365-374
134. SUOMELA, J. 2009. Optimisation problems in wireless sensor networks: Local algorithms and local graphs. Ph.D. thesis, Department of Computer Science, University of Helsinki, Helsinki, Finland
135. TOUSSAINT, G. T. 1980. The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12, 4, 261-268
136. URRUTIA, J. 2007. Local solutions for global problems in wireless networks. J. Discr. Algor. 5, 3, 395-407 (Pubitemid 46771382)
137. VAZIRANI, V. V. 2001. Approximation Algorithms. Springer, Berlin
138. WANG, Y. AND LI, X.-Y. 2006. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Netw. Appl. 11, 2, 161-175 (Pubitemid 43745103)
139. WATTENHOFER, M. ANDWATTENHOFER, R. 2004. Distributed weighted matching. In Proceedings of the 18th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 3274, Springer, 335-348 (Pubitemid 39750524)
140. WATTENHOFER, R. AND ZOLLINGER, A. 2004. XTC: A practical topology control algorithm for ad-hoc networks. In Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society Press.
141. WEICHSEL, P. M. 1962. The Kronecker product of graphs. Proc. Amer.Math. Soc. 13, 1, 47-52
142. WIESE, A. 2007. Local approximation algorithms in unit disk graphs. M.S. thesis, Technische Universität Berlin
143. WIESE, A. AND KRANAKIS, E. 2008a. Impact of locality on location aware unit disk graphs. Algor. 1, 2-29
144. WIESE, A. AND KRANAKIS, E. 2008b. Local maximal matching and local 2-approximation for vertex cover in UDGs. In Proceedings of the 7th International Conference on Ad-Hoc Networks &Wireless. Lecture Notes in Computer Systems, vol. 5198, Springer, 1-14
145. WIESE, A. AND KRANAKIS, E. 2009a. Local construction and coloring of spanners of location aware unit disk graphs. Discr. Math., Algor. Appl. 1, 4, 555-588
146. WIESE, A. AND KRANAKIS, E. 2009b. Local PTAS for dominating and connected dominating set in location aware unit disk graphs. In Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA). Lecture Notes in Computer Science, vol. 5426, Springer, 227-240
147. WIESE, A. AND KRANAKIS, E. 2009c. Local PTAS for independent set and vertex cover in location aware unit disk graphs. Ad Hoc Sensor Wirel. Netw. Int. J. 7, 3-4, 273-293
148. YAMASHITA, M. AND KAMEDA, T. 1996. Computing on anonymous networks: Part I-Characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 1, 69-89 (Pubitemid 126776309)
149. YANNAKAKIS, M. AND GAVRIL, F. 1980. Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 3, 364-372
150. YAO, A. C.-C. 1982. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 4, 721-736
151. ZOLLINGER, A. 2008. Geographic routing. In Encyclopedia of Algorithms, M.-Y. Kao, Ed., Springer.