Impact of knowledge on the cost of treasure hunt in trees

[1]  Elmar Langetepe,et al.  On the optimality of spiral search , 2010, SODA '10.

[2]  Jurek Czyzowicz,et al.  Searching for a non-adversarial, uncooperative agent on a cycle , 2020, Theor. Comput. Sci..

[3]  A. Beck.  On the linear search problem , 1964 .

[4]  David G. Kirkpatrick,et al.  Competitive Search in Symmetric Trees , 2011, WADS.

[5]  Uri Zwick,et al.  Deterministic rendezvous, treasure hunts and strongly universal exploration sequences , 2007, SODA '07.

[6]  Andrzej Pelc.  Reaching a Target in the Plane with no Information , 2018, Inf. Process. Lett..

[7]  Rolf Klein,et al.  Online algorithms for searching and exploration in the plane , 2010, Comput. Sci. Rev..

[8]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2008, SIAM J. Comput..

[9]  Andrzej Pelc,et al.  Deterministic Treasure Hunt in the Plane with Angular Hints , 2020, Algorithmica.

[10]  Pallab Dasgupta,et al.  A Correction to "Agent Searching in a Tree and the Optimality of Iterative Deepening" , 1995, Artif. Intell..

[11]  Mona Singh,et al.  Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..

[12]  Andrzej Pelc,et al.  Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs , 2020, ArXiv.

[13]  Sven Schuierer,et al.  Lower bounds in on-line geometric searching , 1997, Comput. Geom..

[14]  V. S. Anil Kumar,et al.  Optimal constrained graph exploration , 2001, SODA '01.

[15]  D. Newman,et al.  Yet more on the linear search problem , 1970 .

[16]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[17]  Christoph Dürr,et al.  Infinite linear programming and online searching with turn cost , 2017, Theor. Comput. Sci..

[18]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[19]  Andrzej Pelc,et al.  Optimal graph exploration without good maps , 2004, Theor. Comput. Sci..

[20]  Stefan Dobrev,et al.  Improved Lower Bounds for Shoreline Search , 2020, SIROCCO.

[21]  Artur Jez,et al.  On the two-dimensional cow search problem , 2009, Inf. Process. Lett..

[22]  Shmuel Gal,et al.  Search Games: A Review , 2013 .

[23]  Amos Korman,et al.  Multi-round cooperative search games with multiple players , 2020, J. Comput. Syst. Sci..

[24]  Dennis Komm,et al.  Treasure Hunt with Advice , 2015, SIROCCO.

[25]  Alejandro López-Ortiz,et al.  The ultimate strategy to search on m rays? , 2001, Theor. Comput. Sci..

[26]  Pallab Dasgupta,et al.  Agent Searching in a Tree and the Optimality of Iterative Deepening , 1994, Artif. Intell..

[27]  Elmar Langetepe.  Searching for an axis-parallel shoreline , 2012, Theor. Comput. Sci..

[28]  Erik D. Demaine,et al.  Online searching with turn cost , 2004, Theor. Comput. Sci..