Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics

Volumn 159, Issue 15, 2011, Pages 1566-1580

  Hassinen, Marja ^a   Kaasinen, Joel ^a   Kranakis, Evangelos ^b   Polishchuk, Valentin ^a   Suomela, Jukka ^a   Wiese, Andreas ^c  

^a UNIVERSITY OF HELSINKI   (Finland)

^b CARLETON UNIVERSITY   (Canada)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Geometric graphs; Local algorithms; Local horizon; Location aware nodes; Quasi unit disk graphs

Indexed keywords

GEOMETRIC GRAPHS; LOCAL ALGORITHM; LOCAL HORIZON; LOCATION-AWARE NODES; QUASI-UNIT-DISK GRAPHS;

GRAPHIC METHODS;

ALGORITHMS;

EID: 79960901936     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.05.004     Document Type: Article

References (59)

1. Matti strand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto A local 2-approximation algorithm for the vertex cover problem Proc. 23rd Symposium on Distributed Computing DISC 2009 LNCS vol. 5805 2009 Springer 191 205
2. Matti strand, and Jukka Suomela Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks Proc. 22nd Symposium on Parallelism in Algorithms and Architectures SPAA 2010 2010 ACM Press 294 302
3. Hagit Attiya, Hadas Shachnai, and Tami Tamir Local labeling and resource allocation using preprocessing SIAM Journal on Computing 28 4 1999 1397 1413
4. Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin Network decomposition and locality in distributed computation Proc. 30th Symposium on Foundations of Computer Science FOCS 1989 1989 IEEE 364 369 (Pubitemid 20725973)
5. Lali Barrire, Pierre Fraigniaud, Lata Narayanan, and Jaroslav Opatrny Robust position-based routing in wireless ad-hoc networks with irregular transmission ranges Wireless Communications and Mobile Computing Journal 3 2 2003 141 153 (Pubitemid 40183734)
6. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, and Jorge Urrutia Local construction of planar spanners in unit disk graphs with irregular transmission ranges Proc. 7th Latin American Theoretical Informatics Symposium LATIN 2006 LNCS vol. 3887 2006 Springer 286 297 (Pubitemid 43986614)
7. John H. Conway, and Neil J.A. Sloane Sphere Packings, Lattices and Groups 1988 Springer
8. Hallard T. Croft, Kenneth J. Falconer, and Richard K. Guy Unsolved Problems in Geometry 1991 Springer
9. Andrzej Czygrinow, Micha Hakowiak, and Wojciech Wawrzyniak Fast distributed approximations in planar graphs Proc. 22nd Symposium on Distributed Computing DISC 2008 LNCS vol. 5218 2008 Springer 78 92
10. Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, and Jorge Urrutia Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes Proc. 8th Latin American Theoretical Informatics Symposium LATIN 2008 LNCS vol. 4957 2008 Springer 158 169 (Pubitemid 351632184)
11. Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Královi, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, and Jorge Urrutia Local 7-coloring for planar subgraphs of unit disk graphs Theoretical Computer Science 412 18 2011 1696 1704
12. Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, and Jorge Urrutia Local edge colouring of Yao-like subgraphs of unit disk graphs Theoretical Computer Science 410 14 2009 1388 1400
13. Peter G. Doyle, and J. Laurie Snell Random Walks and Electric Networks The Carus Mathematical Monographs vol. 22 1984 The Mathematical Association of America Washington, DC, USA
14. László Fejestóth Lagerungen in der Ebene auf der Kugel und im Raum 1953 Springer
15. Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela, Local approximability of maxmin and minmax linear programs, Theory of Computing Systems (2010) (in press).
16. Patrik Floréen, Marja Hassinen, Petteri Kaski, and Jukka Suomela Tight local approximation results for max-min linear programs Proc. 4th Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2008) LNCS vol. 5389 2008 Springer 2 17
17. Patrik Floréen, Joel Kaasinen, Petteri Kaski, and Jukka Suomela An optimal local approximation algorithm for max-min linear programs Proc. 21st Symposium on Parallelism in Algorithms and Architectures SPAA 2009 2009 ACM Press 260 269
18. Patrik Floréen, Petteri Kaski, Topi Musto, and Jukka Suomela Approximating maxmin linear programs with local algorithms Proc. 22nd International Parallel and Distributed Processing Symposium, IPDPS 2008 2008 IEEE
19. Patrik Floréen, Petteri Kaski, Topi Musto, and Jukka Suomela Local approximation algorithms for scheduling problems in sensor networks Proc. 3rd Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2007) LNCS vol. 4837 2008 Springer 99 113
20. Patrik Floréen, Petteri Kaski, and Jukka Suomela A distributed approximation scheme for sleep scheduling in sensor networks Proc. 4th Conference on Sensor, Mesh and Ad Hoc Communications and Networks SECON 2007 2007 IEEE 152 161
21. Erich Friedman, Circles in squares, June 2002. http://www.stetson.edu/ ~efriedma/cirinsqu/.
22. Andrea Goldsmith Wireless Communications 2005 Cambridge University Press Cambridge, UK
23. Marja Hassinen, Valentin Polishchuk, Jukka Suomela, Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs, in: Proc. 2nd Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks, LOCALGOS 2008, 2008, pp. V.9V.12.
24. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S.S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs Journal of Algorithms 26 2 1998 238 274
25. Iyad A. Kanj, Ljubomir Perkovi, and Ge Xia Computing lightweight spanners locally Proc. 22nd Symposium on Distributed Computing DISC 2008 LNCS vol. 5218 2008 Springer 365 378
26. Iyad A. Kanj, Andreas Wiese, and Fenghui Zhang Local algorithms for edge colorings in UDGs Proc. 35th Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009 LNCS vol. 5911 2010 Springer 202 213
27. Petteri Kaski, Aleksi Penttinen, and Jukka Suomela Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs Ad Hoc & Sensor Wireless Networks: An International Journal 6 34 2008 239 263
28. Kerstin Kirchner, and Gerhard Wengerodt Die dichteste Packung von 36 Kreisen in einem Quadrat Beitrge zur Algebra und Geometrie 25 1987 147 159
29. Bhaskar Krishnamachari Networking Wireless Sensors 2005 Cambridge University Press Cambridge, UK
30. Fabian Kuhn, The price of locality: exploring the complexity of distributed coordination primitives, Ph.D. Thesis, ETH Zurich, 2005.
31. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer What cannot be computed locally! Proc. 23rd Symposium on Principles of Distributed Computing PODC 2004 2004 ACM Press 300 309
32. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer On the locality of bounded growth Proc. 24th Symposium on Principles of Distributed Computing PODC 2005 2005 ACM Press 60 68 (Pubitemid 43218371)
33. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer The price of being near-sighted Proc. 17th Symposium on Discrete Algorithms SODA 2006 2006 ACM Press 980 989 (Pubitemid 43275324)
34. Fabian Kuhn, and Roger Wattenhofer Constant-time distributed dominating set approximation Distributed Computing 17 4 2005 303 310 (Pubitemid 40666262)
35. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger Ad hoc networks beyond unit disk graphs Wireless Networks 14 5 2008 715 729
36. Christoph Lenzen, Synchronization and symmetry breaking in distributed systems, Ph.D. Thesis, ETH Zurich, January 2011.
37. Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer, What can be approximated locally? TIK Report 331, ETH Zurich, Computer Engineering and Networks Laboratory, November 2010.
38. Christoph Lenzen, and Roger Wattenhofer Leveraging Linial's locality limit Proc. 22nd Symposium on Distributed Computing DISC 2008 LNCS vol. 5218 2008 Springer 394 407
39. Christoph Lenzen, and Roger Wattenhofer Minimum dominating set approximation in graphs of bounded arboricity Proc. 24th Symposium on Distributed Computing DISC 2010 LNCS vol. 6343 2010 Springer 510 524
40. Nathan Linial Locality in distributed graph algorithms SIAM Journal on Computing 21 1 1992 193 201
41. Thomas Moscibroda, Locality, scheduling, and selfishness: algorithmic foundations of highly decentralized networks, Ph.D. Thesis, ETH Zurich, 2006.
42. Moni Naor, and Larry Stockmeyer What can be computed locally? SIAM Journal on Computing 24 6 1995 1259 1277
43. Christos H. Papadimitriou, and Mihalis Yannakakis Linear programming without the matrix Proc. 25th Symposium on Theory of Computing STOC 1993 1993 ACM Press 121 129
44. Ronald Peikert, Diethelm Wrtz, Michael Monagan, and Claas de Groot Packing circles in a square: a review and new results Proc. 15th IFIP Conference on System Modelling and Optimization, Zrich, Switzerland, September 1991 Lecture Notes in Control and Information Sciences vol. 180 1992 Springer 45 54
45. David Peleg Distributed Computing A Locality-Sensitive Approach 2000 SIAM
46. Valentin Polishchuk, and Jukka Suomela A simple local 3-approximation algorithm for vertex cover Information Processing Letters 109 12 2009 642 645
47. J. Schaer The densest packing of nine circles in a square Canadian Mathematical Bulletin 8 1965 273 277
48. Petra parl, and Janez erovnik 2 -local 4 3 -competitive algorithm for multicoloring hexagonal graphs Journal of Algorithms 55 1 2005 29 41
49. Jukka Suomela Distributed algorithms for edge dominating sets Proc. 29th Symposium on Principles of Distributed Computing PODC 2010 2010 ACM Press 365 374
50. Jukka Suomela, Survey of local algorithms, 2011, Manuscript. http://www.iki.fi/jukka.suomela/local-survey (submitted for publication).
51. Jorge Urrutia Local solutions for global problems in wireless networks Journal of Discrete Algorithms 5 3 2007 395 407 (Pubitemid 46771382)
52. Yu Wang, and Xiang-Yang Li Localized construction of bounded degree and planar spanner for wireless ad hoc networks Mobile Networks and Applications 11 2 2006 161 175 (Pubitemid 43745103)
53. Gerhard Wengerodt Die dichteste Packung von 16 Kreisen in einem Quadrat Beitrge zur Algebra und Geometrie 16 1983 173 190
54. Andreas Wiese, Local approximation algorithms in unit disk graphs, Master's Thesis, Technische Universitt Berlin, 2007.
55. Andreas Wiese, and Evangelos Kranakis Impact of locality on location aware unit disk graphs Algorithms 1 2008 2 29
56. Andreas Wiese, and Evangelos Kranakis Local maximal matching and local 2-approximation for vertex cover in UDGs Proc. 7th Conference on Ad-Hoc Networks & Wireless AdHoc-NOW 2008 LNCS vol. 5198 2008 Springer 1 14
57. Andreas Wiese, and Evangelos Kranakis Local construction and coloring of spanners of location aware unit disk graphs Discrete Mathematics, Algorithms and Applications 1 4 2009 555 588
58. Andreas Wiese, and Evangelos Kranakis Local PTAS for dominating and connected dominating set in location aware unit disk graphs Proc. 6th Workshop on Approximation and Online Algorithms WAOA 2008 LNCS vol. 5426 2009 Springer 227 240
59. Andreas Wiese, and Evangelos Kranakis Local PTAS for independent set and vertex cover in location aware unit disk graphs Ad Hoc & Sensor Wireless Networks: An International Journal 7 34 2009 273 293