Fast distributed approximations in planar graphs

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

Volumn 5218 LNCS, Issue , 2008, Pages 78-92

  Czygrinow, Andrzej ^a   Hańćkowiak, Michal ^b   Wawrzyniak, Wojciech ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; GRAPH THEORY; PARALLEL ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROXIMATIONS; DISTRIBUTED ALGORITHMS; LOWER BOUNDS; MAXIMUM INDEPENDENT SETS; MAXIMUM MATCHING; MINIMUM DOMINATING SETS; PLANAR GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 56449104037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_6     Document Type: Conference Paper

References (20)

1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network Decomposition and Locality in Distributed Computation, In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364-369 (1989)
2. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70, 32-53 (1986)
3. Czygrinow, A., Hańćkowiak, M.: Distributed almost exact approximations for minor-closed families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 244-255. Springer, Heidelberg (2006)
4. Czygrinow, A., Hańćkowiak, M.: Distributed approximation algorithms in unit disc graphs. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 385-398. Springer, Heidelberg (2006)
5. Czygrinow, A., Hańćkowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms 4(4), 588-607 (2006)
6. Czygrinow, A., Hańćkowiak, M., Szymanska, E.: Distributed approximation approximations for planar graphs. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 296-307. Springer, Heidelberg (2006)
7. Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
8. Elkin, M.: An Overview of Distributed Approximation. ACM SIGACT News Distributed Computing Column 35(4,132), 40-57 (2004)
9. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: Proceedings of 23rd ACM Symposium on the Principles of Distributed Computing (PODC), pp. 300-309 (2004)
10. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273-287. Springer, Heidelberg (2005)
11. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local Approximation Schemes for Ad Hoc and Sensor Networks. In: 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany, pp. 97-103 (2005)
12. Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What Can Be Approximated Locally? In: 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), Munich, Germany, pp. 46-54 (2008)
13. Lenzen, C., Wattenhofer, R.: Leveraging Linial's Locality Limit. In: 22nd International Symposium on Distributed Computing (DISC 2008), Arcachon, France (to appear, 2008)
14. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
15. Naor, M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. on Discrete Mathematics 4(3), 409-412 (1991)
16. Nesetril, J.: Ramsey Theory. In: Graham, R.L., Groschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. II, pp. 1331-1403. Elsevier, Amsterdam (1995)
17. Panconesi, A.: Distributed Algorithms Notes (manuscript)
18. Peleg, D.: Distributed Algorithms. In: A Locality-Sensitive Approach, SIAM Press, Philadelphia (2000)
19. * Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: PODC 2008 (to appear, 2008)
20. West, D.: Introduction to graph theory, 2nd edn. Penitence-Hall Inc. (2001)