Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs - Université de Lorraine Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs

Résumé

We study online routing algorithms on the $Θ 6$-graph and the half-$Θ 6$-graph (which is equivalent to a variant of the Delaunay triangulation). Given a source vertex s and a target vertex t in the $Θ 6$-graph (resp. half-Θ 6-graph), there exists a deterministic online routing algorithm that finds a path from s to t whose length is at most 2 st (resp. 2.89 st) which is optimal in the worst case [Bose et al., siam J. on Computing, 44(6)]. We propose alternative, slightly simpler routing algorithms that are optimal in the worst case and for which we provide an analysis of the average routing ratio for the $Θ 6$-graph and half-$Θ 6$-graph defined on a Poisson point process.
Fichier principal
Vignette du fichier
EuroCG-1.pdf (859.14 Ko) Télécharger le fichier
Vignette du fichier
vignette.png (31.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image
Loading...

Dates et versions

hal-02479502 , version 1 (14-02-2020)

Identifiants

  • HAL Id : hal-02479502 , version 1

Citer

Prosenjit Bose, Jean-Lou de Carufel, Olivier Devillers. Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs. EuroCG 2020 - 36th European Workshop on Computational Geometry, Mar 2020, Würzburg, Germany. ⟨hal-02479502⟩
80 Consultations
52 Téléchargements

Partager

Gmail Facebook X LinkedIn More