2 citations · 2 across the 8 of their papers we have counts for
8 papers
Incremental Strongly Connected Components with Predictions
Ronald Deng, Samuel McCauley, Aidin Niaparast +5
Algorithms with predictions is a growing area that aims to leverage machine-learned predictions to design faster beyond-worst-case algorithms. In this paper, we use this framework…
Incremental Approximate Single-Source Shortest Paths with Predictions
Samuel McCauley, Benjamin Moseley, Aidin Niaparast +2
The algorithms-with-predictions framework has been used extensively to develop online algorithms with improved beyond-worst-case competitive ratios. Recently, there is growing inte…
Binary Search with Distributional Predictions
Michael Dinitz, Sungjin Im, Thomas Lavastida +3
Algorithms with (machine-learned) predictions is a powerful framework for combining traditional worst-case algorithms with modern machine learning. However, the vast majority of wo…
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
Benjamin Moseley, Aidin Niaparast, R. Ravi
We study an online generalization of the classic Joint Replenishment Problem (JRP) that models the trade-off between ordering costs, holding costs, and backlog costs in supply chai…
Incremental Topological Ordering and Cycle Detection with Predictions
Samuel McCauley, Benjamin Moseley, Aidin Niaparast +1
This paper leverages the framework of algorithms-with-predictions to design data structures for two fundamental dynamic graph problems: incremental topological ordering and cycle d…
Online List Labeling with Predictions
Samuel McCauley, Benjamin Moseley, Aidin Niaparast +1
A growing line of work shows how learned predictions can be used to break through worst-case barriers to improve the running time of an algorithm. However, incorporating prediction…
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
Da Qi Chen, Lin An, Aidin Niaparast +2
We consider an information dissemination problem where the root of an undirected graph constantly updates its information. The goal is to keep every other node in the graph about t…
On a question of Haemers regarding vectors in the nullspace of Seidel matrices
Saieed Akbari, Sebastian M. Cioabă, Samira Goudarzi +2
In 2011, Haemers asked the following question: If is the Seidel matrix of a graph of order and is singular, does there exist an eigenvector of corresponding to …