Competitive Routing on a Bounded-Degree Plane Spanner

Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

Abstract

We show that it is possible to route locally and com-petitively on two bounded-degree plane 6-spanners, one with maximum degree 12 and the other with maximum degree 9. Both spanners are subgraphs of the empty equilateral triangle Delaunay triangulation. First, in a weak routing model where the only information stored at each vertex is its neighbourhood, we show how to find a path between any two vertices of a 6-spanner of max-imum degree 12, such that the path has length at most 95/ √ 3 times the straight-line distance between the ver-tices. In a slightly stronger model, where in addition to the neighbourhood of each vertex, we store O(1) addi-tional information, we show how to find a path that has length at most 15/ √ 3 times the Euclidean distance both in a 6-spanner of maximum degree 12 and a 6-spanner of maximum degree 9.
Original languageEnglish
Title of host publicationProceedings of the 24th Canadian Conference on Computational Geometry
Publication date2012
Pages285-290
Publication statusPublished - 2012
EventThe 24th Canadian Conference on Computational Geometry - Charlottetown, Canada
Duration: 8. Aug 201210. Aug 2012
Conference number: 24

Conference

ConferenceThe 24th Canadian Conference on Computational Geometry
Number24
CountryCanada
CityCharlottetown
Period08/08/201210/08/2012

Fingerprint Dive into the research topics of 'Competitive Routing on a Bounded-Degree Plane Spanner'. Together they form a unique fingerprint.

  • Cite this

    Bose, P., Fagerberg, R., Renssen, A. V., & Verdonschot, S. (2012). Competitive Routing on a Bounded-Degree Plane Spanner. In Proceedings of the 24th Canadian Conference on Computational Geometry (pp. 285-290)