暂无分享,去创建一个
[1] David Peleg,et al. Distributed verification and hardness of distributed approximation , 2010, STOC '11.
[2] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[3] Mikkel Thorup,et al. Approximate distance oracles , 2005, J. ACM.
[4] Roger Wattenhofer,et al. Networks cannot compute their diameter in sublinear time , 2012, SODA.
[5] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[6] David Peleg,et al. Distributed Algorithms for Network Diameter and Girth , 2012, ICALP.
[7] Shay Kutten,et al. A sub-linear time distributed algorithm for minimum-weight spanning trees , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[8] Uri Zwick,et al. Exact and Approximate Distances in Graphs - A Survey , 2001, ESA.
[9] Boaz Patt-Shamir,et al. Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.
[10] Parinya Chalermsook,et al. Simple Distributed Algorithms for Approximating Minimum Steiner Trees , 2005, COCOON.
[11] Dahlia Malkhi,et al. Efficient distributed approximation algorithms via probabilistic tree embeddings , 2008, PODC '08.
[12] Shay Kutten,et al. Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.
[13] Michael Dinitz,et al. Efficient computation of distance sketches in distributed networks , 2011, SPAA '12.
[14] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[15] Mikkel Thorup,et al. Compact name-independent routing with minimum stretch , 2008, ACM Trans. Algorithms.
[16] Nicola Santoro,et al. Labelling and Implicit Routing in Networks , 1985, Computer/law journal.
[17] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[18] Roger Wattenhofer,et al. Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.
[19] Mikkel Thorup,et al. Compact routing schemes , 2001, SPAA '01.
[20] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[21] David Peleg,et al. A near-tight lower bound on the time complexity of distributed MST construction , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[22] Bruce S. Davie,et al. Computer Networks: A Systems Approach , 1996 .
[23] Maleq Khan,et al. A fast distributed approximation algorithm for minimum spanning trees , 2007, Distributed Computing.
[24] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[25] John Moy,et al. OSPF Version 2 , 1998, RFC.
[26] Ittai Abraham,et al. On space-stretch trade-offs: lower bounds , 2006, SPAA '06.
[27] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[28] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[29] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007 .