Search Results for author:
Found 4 papers, 2 papers with code
Comparing Graph Transformers via Positional Encodings
The distinguishing power of graph transformers is closely tied to the choice of positional encoding: features used to augment the base transformer with information about the graph.
Understanding Oversquashing in GNNs through the Lens of Effective Resistance
We propose to use total effective resistance as a bound of the total amount of oversquashing in a graph and provide theoretical justification for its use.
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem
For the Euclidean version of the problem, for instance, combining our results with known results on Euclidean TSP, yields a PTAS for approximating an optimal cyclic solution, and it yields a $(2(1-1/k)+\varepsilon)$-approximation of the optimal unrestricted solution.
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
The problem is NP-hard, as it has the traveling salesman problem as a special case (when $k=1$ and all sites have the same weight).
