Distributed approximation algorithms for planar graphs

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

Volumn 3998 LNCS, Issue , 2006, Pages 296-307

  Czygrinow, Andrzej ^a   Hańćkowiak, Michal ^b   Szymańska, Edyta ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE;

APPROXIMATION RATIO; DISTRIBUTED APPROXIMATION ALGORITHMS; PLANAR GRAPHS; POLY-LOGARITHMIC;

GRAPH THEORY;

EID: 33746043752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_29     Document Type: Conference Paper

References (17)

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, pp. 364-369.
2. [CV86] R. Cole, U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, 1986, 70, pp. 32-53.
3. [CH03] A. Czygrinow, M. Hańćkowiak, Distributed Algorithm for Better Approximation of the Maximum Matching, COCOON 2003 LNCS 2697, 2003, pp. 242-251.
4. [CH04] A. Czygrinow, M. Hańćkowiak, Distributed algorithms for weighted problems in sparse graphs, to appear in Journal of Discrete Algorithms, in Press, (Available online 7 September 2005)
5. [CHS04] A. Czygrinow, M. Hańćkowiak, E. Szymańska, Distributed algorithm for approximating the maximum matching, Discrete Applied Mathematics, Volume 143, Issues 1-3, (2004), 62-71.
6. [CHSz04] A. Czygrinow, M. Hańćkowiak, E. Szymańska, A fast distributed algorithm for approximating the maximum matching, Algorithms - ESA 2004 LNCS 3221, (2004), 252-263.
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), pp. 717-724, 2003.
8. [E04] M. Elkin, An Overview of Distributed Approximation, in ACM SIGACT News Distributed Computing Column Volume 35, Number 4 (Whole number 132), Dec. 2004, pp. 40-57.
9. [HMS96] S. Hakimi, J. Mitchem, E. Schmeichel, Star arboricity of graphs, Discrete Mathematics, 149, 1-3, (1996), 93-98.
10. [HKP99] M. Hańćkowiak, M. Karoński, A. Panconesi, A faster distributed algorithm for computing maximal matching deterministically, Proceedings of PODC 99, the Eighteen Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 219-228.
11. [JRS01] L. Jia, R. Rajaraman, and R. Suel, An Efficient Distributed Algorithm for Constructing Small Dominating Sets, In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 33-42, 2001.
12. [KP95] S. Kutten, D. Peleg, Fast distributed construction of k-dominating sets and applications, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, 1995, pp. 238-251.
13. [KW03] F. Kuhn, R. Wattenhofer, Constant-Time Distributed Dominating Set Approximation, 22nd ACM Symposium on the Principles of Distributed Computing (PODC), Boston, Massachusetts, USA, July 2003.
14. [KMW04] F. Kuhn, T. Moscibroda, and R. Wattenhofer, What Cannot Be Computed Locally!, Proceedings of 23rd ACM Symposium on the Principles of Distributed Computing (PODC), 2004, pp. 300-309.
15. [L92] N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 1992, 21(1), pp. 193-201.
16. [L86] M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., vol 15(4), 1986, pp. 1036-1053.
17. [P00] D.Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000.