How to meet asynchronously at polynomial cost

Abstract

Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a positive integer known to it, but unknown to the other agent. Agents move in an asynchronous way: the speed of agents may vary and is controlled by an adversary. The cost of a… (More)
DOI: 10.1145/2484239.2484245

Topics

  • Presentations referencing similar topics