A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks
[article]
2015
arXiv
pre-print
Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds. Each agent has a distinct integer label from the set {1,...,L}. Two main efficiency measures of rendezvous are its time (the number of rounds until the meeting) and its cost (the total number of edge traversals). We investigate tradeoffs between these two measures. A natural benchmark for both time and
arXiv:1508.02471v1
fatcat:i5letegrmrakjpe5srpduwqlnu