Distributed approximation algorithms via LP-duality and randomization

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 13-1-13-22

  Dubhashi, Devdatt ^a   Grandoni, Fabrizio ^b   Panconesi, Alessandro ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863412811     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (53)

1. Basagni, S., Mastrogiovanni, M., Panconesi, A., and Petrioli, C., Localized protocols for ad hoc clustering and backbone formation: A performance comparison, IEEE Trans. on Parallel and Dist. Systems, 17(4), 292, 2006.
2. Rajagopalan, S. and Vazirani, V. V., Primal-dual RNC approximation algorithms for set cover and covering integer programs, SIAM J. Comput., 28(2), 525(electronic), 1999.
3. Vazirani, V. V., Approximation Algorithms, Springer, Berlin, 2001.
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M., Complexity and Approximation, Springer, Berlin, 1999.
5. Raz, R. and Safra, S., A sub-constant error-probability low-degree test, and a sub-constant errorprobability PCP characterization of NP, Proc. of STOC, 1997, p. 475.
6. Arora, S. and Sudan, M., Improved low-degree testing and its applications, Combinatorica, 23(3), 365, 2003.
7. Feige, U., A threshold of ln n for approximating set cover, JACM, 45(4), 634, 1998.
8. Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., and Srinivasan, A., Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, Proc. of SODA, 2003, p. 717.
9. Jia, L., Rajaraman, R., and Suel, T., An efficient distributed algorithm for constructing small dominating sets, Dist. Comput., 15, 193, 2002.
10. Kuhn, F., and Wattenhofer, R., Constant-time distributed dominating set approximation, Dist. Comput., 17(4), 303–310, 2005.
11. Karp, R. M., Probabilistic recurrence relations, JACM, 41(6), 1136, 1994.
12. Dubhashi, D. and Panconesi, A., Concentration of measure for the analysis of randomization algorithms. Cambridge University Press. Forthcoming. http://www.dsi.uniroma1.it/∼ale/Papers/master.pdf
13. Matoušek J., Lectures on Discrete Geometry, Graduate Texts in Mathematics, Vol. 212, Springer, Berlin, 2002.
14. Bellare, M., Goldreich, O., and Sudan, M., Free bits, pcps and non-approximability—towards tight results, SIAM J. Comput., 27, 804, 1998.
15. Feige, U. and Kilian, J., Zero knowledge and the chromatic number, JCSS, 57, 187, 1998.
16. Halldòrsson, M. M., A still better performance guarantee for approximate graph coloring, Inform. Proc. Lett., 45, 19, 1993.
17. Johansson, O., Simple distributed δ + 1-coloring of graphs, Inform. Proc. Lett., 70(5), 229, 1999.
18. Luby, M., Removing randomness in parallel computation without a processor penalty, JCSS, 47(2), 250, 1993.
19. Finocchi, I., Panconesi, A., and Silvestri, R., An experimental study of simple, distributed vertex colouring algorithms, Proc. of SODA, 2002.
20. Czygrinow, A., Hańćkowiak, M., and Karoński, M., Distributed O(Delta log(n))-edge-coloring algorithm, Proc. Eur. Symp. on Algorithms, 2001, p. 345.
21. Bollobas, B., Graph Theory: An Introductory Course, Springer, Berlin, 1979.
22. Dubhashi, D., Grable, D., and Panconesi, A., Nearly-optimal, distributed edge-colouring via the nibble method, Theor. Comp. Sci., 203, 225, 1998.
23. Grable, D. and Panconesi, A., Nearly optimal distributed edge colouring in O(log log n) rounds, Random Struct. Algorithms, 10(3), 385, 1997.
24. Bollobas, B., Chromatic number, girth and maximal degree, SIAM J. Disc. Math., 24, 311, 1978.
25. Grable, D. and Panconesi, A., Fast distributed algorithms for brooks-vizing colourings, Proc. of SODA, 1998, p. 473.
26. McDiarmid, C., Concentration. In Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., and Reed, B., Eds., Probabilistic Methods for Algorithmic Discrete Mathematics, Springer, New York, 1998, 195–248.
27. Molly, M. S. O. and Reed, B. A., A bound on the strong chromatic index of a graph. J. Comb. Theory, Ser. B 69(2), 103–109, 1997.
28. Mitzenmacher, M. and Upfal, E., Probability and Computing, Cambridge University Press, Cambridge, 2005.
29. Dubhashi, D. P., Martingales and locality in distributed computing, FSTTCS 1998, 174–185.
30. Fischer, T., Goldberg, A. V., Haglin, D. J., and Plotkin, S., Approximating matchings in parallel, Inf. Proc. Lett., 46, 115, 1993.
31. Luby, M., A simple parallel algorithm for the maximal independent set problem, Proc. of STOC, 1985, p. 1.
32. Alon, N., Babai, L., and Itai, A., A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7, 567, 1986.
33. Kozen, D., The Design and Analysis of Algorithms, Springer, Berlin, 1992.
34. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput., 2, 225, 1973.
35. Wattenhofer, M. and Wattenhofer, R., Distributed weighted matching, Proc. Intl. Symp. on Dist. Comput., 2004, p. 335.
36. Hańćkowiak, M., Karoński, M., and Panconesi, A., On the distributed complexity of computing maximal matchings, Proc. of SODA, 1998, p. 219.
37. Hańćkowiak, M., Karoński, M., and Panconesi, A., On the distributed complexity of computing maximal matchings, SIAM J. Discrete Math., 15(1), 41, 2001.
38. Czygrinow, A., Háńckowiak, M., and Szymanska, E., A fast distributed algorithm for approximating the maximum matching, Proc. Eur. Symp. on Algorithms, 2004, p. 252.
39. Monien, B. and Speckenmeyer, E., Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Informatica, 22, 115, 1985.
40. Håstad, J., Some optimal inapproximability results, Proc. of STOC, 1997, p. 1.
41. Khuller, S., Vishkin, U., and Young, N., A primal-dual parallel approximation technique applied to weighted set and vertex cover, J. Algorithms, 17(2), 280, 1994.
42. Grandoni, F., Könemann, J., and Panconesi, A., Distributed weighted vertex cover via maximal matchings, Intl. Comput. and Comb. Conf., 2005.
43. Israeli, A. and Itai, A., A fast and simple randomized parallel algorithm for maximal matching, Inf. Proc. Lett., 22, 77, 1986.
44. Grandoni, F., Könemann, J., Panconesi, A., and Sozio, M., Primal-dual based distributed algorithms for vertex cover with semi-hard capacities, Symp. on Principles of Dist. Comput., 2005, p. 118.
45. Naor, M. and Stockmeyer, L., What can be computed locally? SIAM J. Comput., 24(6), 1259, 1995.
46. Peleg, D., Distributed Computing, SIAM Monographs on Disc. Math. and Appl., Vol. 5, 2000.
47. Linial, N., Locality in distributed graph algorithms, SIAM J. Comput., 21(1), 193, 1992.
48. Naor, M., A lower bound on probabilistic algorithms for distributive ring coloring, SIAM J. Disc. Math., 4(3), 409, 1991.
49. Cole, R. and Vishkin, U., Deterministic coin tossing with applications to optimal parallel list ranking, Inf. Control, 70(1), 32, 1986.
50. Garay, J. A., Kutten, S., and Peleg, D., A sublinear time distributed algorithm for minimum-weight spanning trees, SIAM J. Comput., 27(1), 302, 1998.
51. Peleg, D. and Rubinovich, V., A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J. Comput., 30(5), 1427, 2000.
52. Elkin, M., Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem, Proc. of STOC, 2004, p. 331.
53. Kuhn, F., Moscibroda, T., and Wattenhofer, R., What cannot be computed locally! Proc. Symp. on Principles of Dist. Comput., 2004.