Efficient distributed approximation algorithms via probabilistic tree embeddings

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 263-272

  Khan, Maleq ^a   Kuhn, Fabian ^b   Malkhi, Dahlia ^c   Pandurangan, Gopal ^d   Talwar, Kunal ^c  

^a VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

^b ETH ZURICH   (Switzerland)

^c MICROSOFT RESEARCH   (United States)

^d Purdue University   (United States)

Author keywords

Distributed approximation; Generalized Steiner forests; Least element lists; Metric spaces; Network optimization; Probabilistic tree embeddings

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; EMBEDDINGS; FORESTRY; GRAPH THEORY;

DISTRIBUTED APPROXIMATION; GENERALIZED STEINER FORESTS; LEAST ELEMENT LISTS; METRIC SPACES; NETWORK OPTIMIZATION; PROBABILISTIC TREE EMBEDDINGS;

APPROXIMATION ALGORITHMS;

EID: 57549102790     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400787     Document Type: Conference Paper

References (24)

1. B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In 19th STOC, 1987.
2. P. Chalermsook and J. Fakcharoenphol. Simple distributed algorithms for approximating minimum steiner trees. In 11th COCOON, 2005.
3. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. JCSS, 55(3):441-453, 1997.
4. E. Cohen and H. Kaplan. Spatially-decaying aggregation over a network. JCSS, 73(3):265-288, 2007.
5. D. Dubhashi, F. Grandioni, and A. Panconesi. Distributed algorithms via lp duality and randomization. In Handbook of Approximation Algorithms and Metaheuristics. 2007.
6. M. Elkin. Computing almost shortest paths. In 20th PODC, 2001.
7. M. Elkin. Distributed approximation - a survey. ACM SIGACT News, 35(4):40-57, 2004.
8. M. Elkin. A faster distributed protocol for constructing minimum spanning tree. In 15th SODA, 2004.
9. M. Elkin. Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In 36th STOC, 2004.
10. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. JCSS, 69(3):485-497, 2004.
11. R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems, 5(1):66-77, 1983.
12. J. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing, 27:302-316, 1998.
13. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. In 24th PODC, 2005.
14. L. Jia. R. Rajaraman, and R. Suel. An efficient distributed algorithm for constructing small dominating sets. Distributed Computing, 15(4): 193-205, 2002.
15. M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20:391-402, 2008.
16. F. Kuhn and T. Moscibroda. Distributed Approximation of Capacitated Dominating Sets. In 19th SPAA, 2007.
17. F. Kuhn. T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In 23rd PODC, 2004.
18. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The Price of Being Near-Sighted. In 17th SODA, 2006.
19. S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. J. Algorithms, 28:40-66, 1998.
20. D. Peleg. A time optimal leader election algorithm in general networks. J. Parallel and Distributed Computing, 8:96-99, 1990.
21. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
22. D. Peleg and V. Rabinovich. A near-tight lower bound on the time complexity of distributed mst construction. In 40th FOCS, 1999.
23. V. Vazirani. Approximation Algorithms. Springer Verlag, 2004.
24. B. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C. Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. In 9th SODA, 1998.