Search Results for author:
Found 3 papers, 0 papers with code
Online TSP with Predictions
We initiate the study of online routing problems with predictions, inspired by recent exciting results in the area of learning-augmented algorithms.
Tight Competitive Analyses of Online Car-sharing Problems
In this paper, we remove all the holes of unknown CR's; namely we prove that the CR is $\frac{2k}{k + \lfloor k/3 \rfloor}$ for all $k\geq 2$.
Data Structures and Algorithms
Topological Interference Management with Adversarial Topology Perturbation: An Algorithmic Perspective
This is a sharp reduction of the general graph re-coloring, whose optimal number of updates scales as the size of the network, thanks to the delicate exploitation of the structural properties of chordal graph classes.
Information Theory Information Theory
