Pebble guided optimal treasure hunt in anonymous graphs

DOI10.1016/j.tcs.2022.04.011OpenAlexW4224297924MaRDI QIDQ2672573

Kaushik Mondal, Himadri Nayak, Barun Gorain, Supantha Pandit

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.011

zbMATH Keywords

deterministic algorithmsmobile agentanonymous graphpebblestreasure hunt

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Treasure hunt in graph using pebbles

Cites Work

• Unnamed Item
• Unnamed Item
• Searching for an axis-parallel shoreline
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• How many ants does it take to find the food?
• On the two-dimensional cow search problem
• The theory of search games and rendezvous.
• Deterministic treasure hunt in the plane with angular hints
• Online searching with turn cost
• Yet more on the linear search problem
• Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
• Deterministic Graph Exploration with Advice
• Searching a Tree with Permanently Noisy Advice
• Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents

This page was built for publication: Pebble guided optimal treasure hunt in anonymous graphs