Constrained routing between non-visible vertices

Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Routing is an important problem in networks. We look at routing in the presence of line segment constraints (i.e., obstacles that our edges are not allowed to cross). Let P be a set of n vertices in the plane and let S be a set of line segments between the vertices in P, with no two line segments intersecting properly. We present the first 1-local O(1)-memory routing algorithm on the visibility graph of P with respect to a set of constraints S (i.e., it never looks beyond the direct neighbours of the current location and does not need to store more than O(1)-information to reach the target). We also show that when routing on any triangulation T of P such that S\subseteq T, no o(n)-competitive routing algorithm exists when only considering the triangles intersected by the line segment from the source to the target (a technique commonly used in the unconstrained setting). Finally, we provide an O(n)-competitive 1-local O(1)-memory routing algorithm on any such T, which is optimal in the worst case, given the lower bound.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings
EditorsYixin Cao, Jianer Chen
PublisherSpringer Verlag
Pages62-74
Number of pages13
ISBN (Print)9783319623887
DOIs
Publication statusPublished - 2017
Event23rd International Conference on Computing and Combinatorics, COCOON 2017 - Hong Kong, China
Duration: 2017 Aug 32017 Aug 5

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other23rd International Conference on Computing and Combinatorics, COCOON 2017
CountryChina
CityHong Kong
Period17/8/317/8/5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Constrained routing between non-visible vertices'. Together they form a unique fingerprint.

Cite this