Additive Spanners in Nearly Quadratic Time
暂无分享,去创建一个
[1] Seth Pettie,et al. Low distortion spanners , 2007, TALG.
[2] Polylog-time and near-linear work approximation scheme for undirected shortest paths , 2000, JACM.
[3] Telikepalli Kavitha,et al. Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[4] Mikkel Thorup,et al. Approximate distance oracles , 2005, J. ACM.
[5] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[6] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[7] Lenore Cowen,et al. Compact routing with minimum stretch , 1999, SODA '99.
[8] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[9] Edith Cohen. Fast algorithms for constructing t-spanners and paths with stretch t , 1993, FOCS.
[10] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[11] David P. Woodruff. Lower Bounds for Additive Spanners, Emulators, and More , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[12] Sandeep Sen,et al. Approximate distance oracles for unweighted graphs in Õ (n2) time , 2004, SODA '04.
[13] Mikkel Thorup,et al. Spanners and emulators with sublinear distance errors , 2006, SODA '06.
[14] Ittai Abraham,et al. On space-stretch trade-offs: lower bounds , 2006, SPAA '06.
[15] Mikkel Thorup,et al. Compact routing schemes , 2001, SPAA '01.
[16] Kurt Mehlhorn,et al. New constructions of (alpha, beta)-spanners and purely additive spanners , 2005, SODA.
[17] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[18] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[19] Kurt Mehlhorn,et al. Additive spanners and (α, β)-spanners , 2010, TALG.
[20] Lenore Cowen,et al. Compact roundtrip routing in directed networks , 2004, J. Algorithms.
[21] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[22] Mikkel Thorup,et al. Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.
[23] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[24] Susan Elkin,et al. Books, books and more books , 2009 .
[25] Ittai Abraham,et al. On space-stretch trade-offs: upper bounds , 2006, SPAA.
[26] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.