Competitive Online Routing on Delaunay Triangulations
暂无分享,去创建一个
Prosenjit Bose | Stephane Durocher | Jean-Lou De Carufel | Perouz Taslakian | S. Durocher | P. Bose | Perouz Taslakian | J. Carufel | Stephane Durocher
[1] Pat Morin,et al. Memoryless routing in convex subdivisions: Random walks are optimal , 2012, Comput. Geom..
[2] Franz Aurenhammer,et al. Voronoi Diagrams and Delaunay Triangulations , 2013 .
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Franziska Hoffmann,et al. Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .
[5] Ivan Stojmenovic,et al. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.
[6] David G. Kirkpatrick,et al. On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2008, Wirel. Networks.
[7] Prosenjit Bose,et al. Online Routing in Triangulations , 1999, SIAM J. Comput..
[8] Prosenjit Bose,et al. Competitive Online Routing in Geometric Graphs , 2004, SIROCCO.
[9] Roger Wattenhofer,et al. Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.
[10] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Mark Braverman. On ad hoc routing with guaranteed delivery , 2008, PODC '08.
[12] Albert Y. Zomaya,et al. New Memoryless Online Routing Algorithms for Delaunay Triangulations , 2012, IEEE Transactions on Parallel and Distributed Systems.
[13] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[14] Ge Xia,et al. The Stretch Factor of the Delaunay Triangulation Is Less than 1.998 , 2011, SIAM J. Comput..
[15] Ge Xia,et al. On the stretch factor of Delaunay triangulations of points in convex position , 2011, Comput. Geom..
[16] Carl Gutwin,et al. Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..
[17] Ronald L. Rivest,et al. Introduction to Algorithms, 3rd Edition , 2009 .
[18] Fabian Kuhn,et al. Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.
[19] Prosenjit Bose,et al. Bounding the locality of distributed routing algorithms , 2009, PODC '09.
[20] Jorge Urrutia,et al. Compass routing on geometric networks , 1999, CCCG.
[21] Prosenjit Bose,et al. On the Stretch Factor of the Constrained Delaunay Triangulation , 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.
[22] Prosenjit Bose,et al. Online Routing in Convex Subdivisions , 2000, ISAAC.
[23] Maia Fraser. Local Routing on Tori , 2008, Ad Hoc Sens. Wirel. Networks.
[24] Jorge Urrutia,et al. Memory Requirements for Local Geometric Routing and Traversal in Digraphs , 2008, CCCG.