Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

Amnon Ta-Shma; Uri Zwick

Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

Amnon Ta-Shma, Uri Zwick

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

56 Scopus citations

Abstract

We obtain several improved solutions for the deterministic rendezvous problem in general undirected graphs. Our solutions answer several problems left open in a recent paper by Dessmark et al. We also introduce an interesting variant of the rendezvous problem which we call the deterministic treasure hunt problem. Both the rendezvous and the treasure hunt problems motivate the study of universal traversal sequences and universal exploration sequences with some strengthened properties. We call such sequences strongly universal traversal (exploration) sequences. We give an explicit construction of strongly universal exploration sequences. The existence of strongly universal traversal sequences, as well as the solution of the most difficult variant of the deterministic treasure hunt problem, are left as intriguing open problems.

Original language	English
Title of host publication	Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Publisher	Association for Computing Machinery
Pages	599-608
Number of pages	10
ISBN (Electronic)	9780898716245
State	Published - 2007
Event	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States Duration: 7 Jan 2007 → 9 Jan 2007

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	07-09-January-2007

Conference

Conference	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Country/Territory	United States
City	New Orleans
Period	7/01/07 → 9/01/07

Funding

Funders	Funder number
German-Israeli Foundation for Scientific Research and Development
United States-Israel Binational Science Foundation
Israel Science Foundation

Cite this

@inproceedings{c29f02a2f20b4e03a24a73f595c8d136,

title = "Deterministic rendezvous, treasure hunts and strongly universal exploration sequences",

abstract = "We obtain several improved solutions for the deterministic rendezvous problem in general undirected graphs. Our solutions answer several problems left open in a recent paper by Dessmark et al. We also introduce an interesting variant of the rendezvous problem which we call the deterministic treasure hunt problem. Both the rendezvous and the treasure hunt problems motivate the study of universal traversal sequences and universal exploration sequences with some strengthened properties. We call such sequences strongly universal traversal (exploration) sequences. We give an explicit construction of strongly universal exploration sequences. The existence of strongly universal traversal sequences, as well as the solution of the most difficult variant of the deterministic treasure hunt problem, are left as intriguing open problems.",

author = "Amnon Ta-Shma and Uri Zwick",

note = "Publisher Copyright: Copyright {\textcopyright} 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.; 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 ; Conference date: 07-01-2007 Through 09-01-2007",

year = "2007",

language = "אנגלית",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "599--608",

booktitle = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007",

address = "ארצות הברית",

}

Ta-Shma, A & Zwick, U 2007, Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 07-09-January-2007, Association for Computing Machinery, pp. 599-608, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, United States, 7/01/07.

Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. / Ta-Shma, Amnon ; Zwick, Uri.
Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, 2007. p. 599-608 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 07-09-January-2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

AU - Ta-Shma, Amnon

AU - Zwick, Uri

PY - 2007

Y1 - 2007

N2 - We obtain several improved solutions for the deterministic rendezvous problem in general undirected graphs. Our solutions answer several problems left open in a recent paper by Dessmark et al. We also introduce an interesting variant of the rendezvous problem which we call the deterministic treasure hunt problem. Both the rendezvous and the treasure hunt problems motivate the study of universal traversal sequences and universal exploration sequences with some strengthened properties. We call such sequences strongly universal traversal (exploration) sequences. We give an explicit construction of strongly universal exploration sequences. The existence of strongly universal traversal sequences, as well as the solution of the most difficult variant of the deterministic treasure hunt problem, are left as intriguing open problems.

AB - We obtain several improved solutions for the deterministic rendezvous problem in general undirected graphs. Our solutions answer several problems left open in a recent paper by Dessmark et al. We also introduce an interesting variant of the rendezvous problem which we call the deterministic treasure hunt problem. Both the rendezvous and the treasure hunt problems motivate the study of universal traversal sequences and universal exploration sequences with some strengthened properties. We call such sequences strongly universal traversal (exploration) sequences. We give an explicit construction of strongly universal exploration sequences. The existence of strongly universal traversal sequences, as well as the solution of the most difficult variant of the deterministic treasure hunt problem, are left as intriguing open problems.

UR - http://www.scopus.com/inward/record.url?scp=84860831356&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84860831356

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 599

EP - 608

BT - Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

PB - Association for Computing Machinery

T2 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

Y2 - 7 January 2007 through 9 January 2007

ER -

Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

Abstract

Publication series

Conference

Funding

Other files and links

Fingerprint

Cite this