Distributed approximation algorithms for weighted shortest paths

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2014, Pages 565-573

  Nanongkai, Danupon ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

All pairs shortest paths; CONGEST model; Distributed computing; Graph algorithms; Lower bounds; Single source shortest paths; Time complexity

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

ALL-PAIRS SHORTEST PATHS; GRAPH ALGORITHMS; LOWER BOUNDS; SINGLE-SOURCE SHORTEST PATHS; TIME COMPLEXITY;

APPROXIMATION ALGORITHMS;

EID: 84904316453     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591796.2591850     Document Type: Conference Paper

References (50)

1. J. Abram and I. Rhodes. Some shortest path algorithms with decentralized information and communication requirements. Automatic Control, IEEE Transactions on, 27(3):570-582, 1982.
2. Y. Afek and M. Ricklin. Sparser: A paradigm for running distributed algorithms. J. Algorithms, 14(2):316-328, 1993.
3. J. K. Antonio, G. M. Huang, and W. K. Tsai. A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Trans. Computers, 41(6):710-724, 1992.
4. J. Augustine, G. Pandurangan, P. Robinson, and E. Upfal. Towards robust and efficient computation in dynamic peer-to-peer networks. In SODA, pages 551-569, 2012.
5. S. Baswana and S. Sen. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms, 30(4):532-563, 2007. Also in ICALP'03.
6. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87-90, 1958.
7. A. Berns, J. Hegeman, and S. V. Pemmaraju. Super-fast distributed algorithms for metric facility location. In ICALP (2), pages 428-439, 2012.
8. A. Bernstein. Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]. In STOC, pages 725-734, 2013.
9. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM, 47(1):132-166, 2000. Announced at STOC 1994.
10. A. Das Sarma, M. Dinitz, and G. Pandurangan. Efficient computation of distance sketches in distributed networks. In SPAA, pages 318-326, 2012.
11. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM J. Comput., 41(5):1235-1265, 2012. Announced at STOC 2011.
12. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Distributed random walks. J. ACM, 60(1):2, 2013. Also in PODC'09 and PODC'10.
13. C. Demetrescu, I. Finocchi, and G. Italiano. Handbook on Data Structures and Applications, chapter 36: Dynamic Graphs. Dinesh Mehta and Sartaj Sahni (eds.), CRC Press Series, in Computer and Information Science, 2005.
14. D. Dolev, C. Lenzen, and S. Peled. "tri, tri again": Finding triangles and small subgraphs in a distributed setting-(extended abstract). In DISC, pages 195-209, 2012.
15. M. Elkin. Distributed approximation: a survey. SIGACT News, 35(4):40-57, 2004.
16. M. Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1(2):283-323, 2005. Also in PODC'01.
17. M. Elkin. An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem. SIAM J. Comput., 36(2):433-456, 2006. Also in STOC'04.
18. M. Elkin, H. Klauck, D. Nanongkai, and G. Pandurangan. Quantum distributed network computing: Lower bounds and techniques. CoRR, abs/1207.5211, 2012.
19. M. Elkin and J. Zhang. Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models. Distributed Computing, 18(5):375-385, 2006. Also in PODC'04.
20. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485-497, 2004. Also in STOC'03.
21. L. R. Ford. Network Flow Theory. Report P-923, The Rand Corporation, 1956.
22. S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks cannot compute their diameter in sublinear time. In SODA, pages 1150-1162, 2012.
23. J. A. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput., 27(1):302-316, 1998. Also in FOCS'93.
24. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In DISC, pages 1-15, 2013.
25. S. Haldar. An 'all pairs shortest paths' distributed algorithm using 2n2 messages. J. Algorithms, 24(1):20-36, 1997.
26. S. Holzer. Distance Computation, Information Dissemination, and Wireless Capacity in Networks, Diss. ETH No. 21444. Phd thesis, ETH Zurich, Zurich, Switzerland, 2013.
27. S. Holzer and R. Wattenhofer. Optimal distributed all pairs shortest paths and applications. In PODC, pages 355-364, 2012.
28. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Computing, 25(3):189-205, 2012. Also in PODC'08.
29. M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20(6):391-402, 2008. Also in DISC'06.
30. P. N. Klein and S. Sairam. A parallel randomized approximation scheme for shortest paths. In STOC, pages 750-758, 1992.
31. L. Kor, A. Korman, and D. Peleg. Tight bounds for distributed minimum-weight spanning tree verification. Theory Comput. Syst., 53(2):318-340, 2013.
32. S. Kutten and D. Peleg. Fast distributed construction of small k-dominating sets and applications. J. Algorithms, 28(1):40-66, 1998.
33. F. T. Leighton, B. M. Maggs, and S. Rao. Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. Combinatorica, 14(2):167-186, 1994. Also in FOCS'88.
34. C. Lenzen. Optimal deterministic routing and sorting on the congested clique. In PODC, pages 42-50, 2013.
35. C. Lenzen and B. Patt-Shamir. Fast routing table construction using small messages: extended abstract. In STOC, pages 381-390, 2013.
36. C. Lenzen and R. Wattenhofer. Tight bounds for parallel randomized load balancing: extended abstract. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 11-20, New York, NY, USA, 2011. ACM.
37. Z. Lotker, B. Patt-Shamir, E. Pavlov, and D. Peleg. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. SIAM J. Comput., 35(1):120-131, July 2005. Also in SPAA'03.
38. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed mst for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006.
39. Z. Lotker, B. Patt-Shamir, and A. Rosén. Distributed approximate matching. SIAM J. Comput., 39(2):445-460, 2009.
40. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996.
41. B. Patt-Shamir and M. Teplitsky. The round complexity of distributed sorting: extended abstract. In Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pages 249-256, New York, NY, USA, 2011. ACM.
42. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
43. D. Peleg, L. Roditty, and E. Tal. Distributed algorithms for network diameter and girth. In ICALP (2), pages 660-672, 2012.
44. D. Peleg and V. Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput., 30(5):1427-1442, 2000. Also in FOCS'99.
45. S. Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons. Distributed Computing, 22(3):147-166, 2010. Also in PODC'08.
46. D. Pritchard and R. Thurimella. Fast computation of small cuts via cycle space sampling. ACM Transactions on Algorithms, 7(4):46, 2011. Also in ICALP'08.
47. P. Raghavan and C. D. Thompson. Provably good routing in graphs: Regular arrays. In STOC, pages 79-87, 1985.
48. N. Santoro. Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing). Wiley-Interscience, 2006.
49. M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005. Also in STOC'11.
50. R. Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. J. Algorithms, 23(1):160-179, 1997. Also in PODC'95.