Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
暂无分享,去创建一个
[1] Virginia Vassilevska Williams,et al. Very Sparse Additive Spanners and Emulators , 2015, ITCS.
[2] Bilel Derbel,et al. Fast distributed graph partition and application , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[3] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[4] Seth Pettie,et al. Low distortion spanners , 2007, TALG.
[5] Shang-Hua Teng,et al. Lower-stretch spanning trees , 2004, STOC '05.
[6] Edith Cohen. Fast Algorithms for Constructing t-Spanners and Paths with Stretch t , 1998, SIAM J. Comput..
[7] Uri Zwick,et al. On Dynamic Shortest Paths Problems , 2004, Algorithmica.
[8] Michael Elkin,et al. Distributed Strong Diameter Network Decomposition , 2016, ArXiv.
[9] David Peleg,et al. Proximity-Preserving Labeling Schemes and Their Applications , 1999, WG.
[10] Michael Elkin,et al. Fast Constructions of Lightweight Spanners for General Graphs , 2012, ACM Trans. Algorithms.
[11] Shiri Chechik,et al. New Additive Spanners , 2013, SODA.
[12] Baruch Awerbuch,et al. Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..
[13] Joan Feigenbaum,et al. Graph distances in the streaming model: the value of space , 2005, SODA '05.
[14] Aravind Srinivasan,et al. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..
[15] Noga Alon,et al. The Moore Bound for Irregular Graphs , 2002, Graphs Comb..
[16] Bilel Derbel,et al. On the locality of distributed sparse spanner construction , 2008, PODC '08.
[17] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[18] Michael E. Saks,et al. Decomposing graphs into regions of small diameter , 1991, SODA '91.
[19] Stephen Alstrup,et al. Constructing Light Spanners Deterministically in Near-Linear Time , 2017, ESA.
[20] Seth Pettie,et al. A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs , 2015, SODA.
[21] Guy E. Blelloch,et al. Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs , 2011, SPAA '11.
[22] Béla Bollobás,et al. Sparse distance preservers and additive spanners , 2003, SODA '03.
[23] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[24] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[25] Amir Abboud,et al. The 4/3 additive spanner exponent is tight , 2015, J. ACM.
[26] Lenore Cowen,et al. Near-linear cost sequential and distributed constructions of sparse neighborhood covers , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[27] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[28] Kurt Mehlhorn,et al. Additive spanners and (α, β)-spanners , 2010, TALG.
[29] Michael Elkin,et al. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.
[30] Gary L. Miller,et al. A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[31] Ittai Abraham,et al. Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.
[32] Michael Elkin,et al. Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.
[33] David P. Woodruff. Lower Bounds for Additive Spanners, Emulators, and More , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[34] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007 .
[35] N Linial,et al. Low diameter graph decompositions , 1993, Comb..
[36] Michael Elkin,et al. Efficient algorithms for constructing very sparse spanners and emulators , 2017, SODA 2017.
[37] Eli Upfal,et al. A tradeoff between space and efficiency for routing tables , 1988, STOC '88.
[38] Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons , 2009, Distributed Computing.
[39] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[40] Seth Pettie,et al. A Hierarchy of Lower Bounds for Sublinear Additive Spanners , 2016, SODA.
[41] John H. Reif,et al. Synthesis of Parallel Algorithms , 1993 .
[42] Ittai Abraham,et al. Advances in metric embedding theory , 2006, STOC '06.
[43] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[44] Shay Solomon,et al. The Greedy Spanner is Existentially Optimal , 2016, PODC.
[45] Michael Elkin,et al. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners , 2006, PODC '07.
[46] Jian Zhang,et al. Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. , 2004, PODC 2004.
[47] Gary L. Miller,et al. Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.
[48] Gary L. Miller,et al. Parallel graph decompositions using random shifts , 2013, SPAA.
[49] Michael Elkin,et al. Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[50] Mikkel Thorup,et al. Spanners and emulators with sublinear distance errors , 2006, SODA '06.
[51] K. Subramani,et al. A faster algorithm for the single source shortest path problem with few distinct positive lengths , 2010, J. Discrete Algorithms.
[52] Polylog-time and near-linear work approximation scheme for undirected shortest paths , 2000, JACM.
[53] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[54] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[55] Michael Elkin,et al. Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models , 2006, Distributed Computing.
[56] Yair Bartal. Graph Decomposition Lemmas and Their Role in Metric Embedding Methods , 2004, ESA.
[57] Michael Elkin,et al. Distributed Strong Diameter Network Decomposition: Extended Abstract , 2016, PODC.
[58] Surender Baswana,et al. Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..
[59] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[60] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[61] Jaikumar Radhakrishnan,et al. An entropy based proof of the Moore bound for irregular graphs , 2010, ArXiv.
[62] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[63] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.
[64] Sandeep Sen,et al. A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs , 2003, ICALP.
[65] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.