1 citations · 1 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Approximation Algorithms for -Shortest Path and -Group Steiner Tree
Yury Makarychev, Max Ovsiankin, Erasmo Tani
We present polylogarithmic approximation algorithms for variants of the Shortest Path, Group Steiner Tree, and Group ATSP problems with vector costs. In these problems, each edge e…
cs.DS2024★ 1 cited
Learning-Based Algorithms for Graph Searching Problems
Adela Frances DePavia, Erasmo Tani, Ali Vakilian
We consider the problem of graph searching with prediction recently introduced by Banerjee et al. (2022). In this problem, an agent, starting at some vertex has to traverse a (…