On Additive Spanners in Weighted Graphs with Local Error
暂无分享,去创建一个
[1] David P. Dobkin,et al. Generating Sparse Spanners for Weighted Graphs , 1990, SWAT.
[2] Oren Salzman,et al. Sparsification of motion-planning roadmaps by edge contraction , 2014, Int. J. Robotics Res..
[3] Telikepalli Kavitha. New Pairwise Spanners , 2016, Theory of Computing Systems.
[4] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[5] Ami Paz,et al. Distributed Construction of Purely Additive Spanners , 2016, DISC.
[6] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[7] Shiri Chechik,et al. New Additive Spanners , 2013, SODA.
[8] Christian Wulff-Nilsen,et al. Near-Optimal Light Spanners , 2016, SODA.
[9] Kostas E. Bekris,et al. Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners , 2013, IEEE Transactions on Robotics.
[10] Giri Narasimhan,et al. New sparseness results on graph spanners , 1992, SCG '92.
[11] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[12] Telikepalli Kavitha,et al. Small Stretch Pairwise Spanners and Approximate D-Preservers , 2015, SIAM J. Discret. Math..
[13] Stephen G. Kobourov,et al. Graph Spanners: A Tutorial Review , 2020, Comput. Sci. Rev..
[14] Greg Bodwin. A Note on Distance-Preserving Graph Sparsification , 2020 .
[15] Samir Khuller,et al. Balancing minimum spanning and shortest path trees , 1993, SODA '93.
[16] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[17] David P. Woodruff. Additive Spanners in Nearly Quadratic Time , 2010, ICALP.
[18] Mathias Bæk Tejs Knudsen,et al. Additive Spanners: A Simple Construction , 2014, SWAT.
[19] Michael Elkin,et al. Light Spanners , 2014, ICALP.
[20] Kostas E. Bekris,et al. Sparse roadmap spanners for asymptotically near-optimal motion planning , 2014, Int. J. Robotics Res..
[21] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[22] Abu Reyan Ahmed,et al. Weighted Additive Spanners , 2020, WG.
[23] Leizhen Cai,et al. Computing Visibility Information in an Inaccurate Simple Polygon , 1997, Int. J. Comput. Geom. Appl..
[24] Shay Solomon,et al. The Greedy Spanner is Existentially Optimal , 2016, PODC.