Distributed approximation algorithms in unit-disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4167 LNCS, Issue , 2006, Pages 385-398

  Czygrinow, A ^a   Hanckowiak M ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS; GRAPH THEORY; NUMBER THEORY;

APPROXIMATION ERRORS; POLY-LOGARITHMIC NUMBERS;

PARALLEL ALGORITHMS;

EID: 33845232593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_27     Document Type: Conference Paper

References (16)

1. [AGLP89] B. Awerbuch, A. V. Goldberg, M. Luby, S. A. Plotkin, Network Decomposition and Locality in Distributed Computation, Proc. 30th IEEE Symp. on Foundations of Computer Science, (1989), 364-369.
2. [CHLWD03] X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du, Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks, Volume 42, Issue 4, Networks, (2003), 202-208.
3. [CH06] A. Czygrinow, M. Hańćkowiak, Distributed algorithms for weighted problems in sparse graphs, Journal of Discrete Algorithms, in press, (2006).
4. [CHS06] A. Czygrinow, M. Hańćkowiak, E. Szymańska, Distributed approximation algorithms for planar graphs, 6th Conference on Algorithms and Complexity, CIAC 2006, accepted, (2006).
5. [D97] R. Diestel, Graph Theory, Springer, New York, (1997).
6. [DW04] F. Dai, J. Wu, An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks, IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 10, (2004), 908-920.
7. [DPRS03] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons, In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), (2003), 717-724.
8. [GGHZZ01] J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, Discrete mobile centers, In Proc of the 17th annual Symposium on Computational Geometry (SCG), (2001), 188-196.
9. [KMW05] F. Kuhn, T. Moscibroda, and R. Wattenhofer, On the Locality of Bounded Growth, 24th ACM Symposium on the Principles of Distributed Computing (PODC), Las Vegas, Nevada, USA, (2005), 60-68.
10. [KMNW05a] F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer, Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs, 19th International Symposium on Distributed Computing (DISC), Cracow, Poland, September (2005), 273-287.
11. [KMNW05b] F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer, Local Approximation Schemes for Ad Hoc and Sensor Networks, 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany, (2005), 97-103.
12. [L82] D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal of Computing, 11(2), (1998), 329-343.
13. [L92] N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 21(1), (1992), 193-201.
14. [NH05] T. Nieberg, J. L. Hurink, A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs, 3rd Workshop on Approximation and Online Algorithms, WAOA 2005, Mallorca, Spain, October 2005, Springer LNCS 3879, (2005), 296-306.
15. [PR01] A. Panconesi, R. Rizzi, Some Simple Distributed Algorithms for Sparse Networks, Distributed Computing 14, (2001), 97-100.
16. [P00] D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000.