We study the two-player communication problem of determining whether two vertices $ x, y $
are nearby in a graph $ G $, with the goal of determining the graph structures that allow the …

We consider the problem of graph searching with prediction recently introduced by Banerjee
et al.(2023). In this problem, an agent starting at some vertex r has to traverse a (potentially …

We study the use of machine learning techniques to solve a fundamental shortest path
problem, known as the single-source many-targets shortest path problem (SSMTSP). Given …

Greedy best-first search (GBFS) and A* search (A*) are popular algorithms for path-finding
on large graphs. Both use so-called heuristic functions, which estimate how close a vertex is …

Good algorithms exhibit three key qualities: speed, accuracy, and optimal objective value.
We explore the interaction among these criteria through optimization problems grounded in …

We study several problems about sublinear algorithms, presented in two parts. Part I:
Property testing and learning. There are two main goals of research in property testing and …

Algorithms are everywhere. Imagine the day of a millennial in Amsterdam. The shortest route
is shown on their phone, the 'recommended for you'music list plays on their headphones …