Written on 10.11.22 by Sebastian Brandt
Here is the list of papers that we will use for the proseminar. Each student will be assigned one of the papers.
Lower and Upper Competitive Bounds for Online Directed Graph Exploration Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs A Game of Cops and Robbers The Capture… Read more
Lower and Upper Competitive Bounds for Online Directed Graph Exploration Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs A Game of Cops and Robbers The Capture Time of Grids Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond How Many Ants Does It Take To Find the Food? An Analysis of Several Heuristics for the Traveling Salesman Problem (see materials tab) The Online Graph Exploration Problem on Restricted Graphs Computing by Programmable Particles Multiple Agents Rendezvous in a Ring in spite of a Black Hole Online Graph Exploration: New Results on Old and New Algorithms Graph Exploration by a Finite Automaton Searching in the Plane Overcoming Obstacles with Ants Gathering Autonomous Mobile Robots Tight Bounds for Deterministic High-Dimensional Grid Exploration Online Graph Exploration with Advice (see materials tab) Treasure Hunt with Advice (see materials tab)
